{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QCYSA6JVGCCNLNKVMWYKSECGA7","short_pith_number":"pith:QCYSA6JV","canonical_record":{"source":{"id":"1110.3107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-14T02:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"adfc449da58d2ed03d747b080bdf717b275b1fa3a7720d6b3507f6adf6b450b2","abstract_canon_sha256":"fb302d0a1aefe7ec0b449024a14f2f618dd6d32656a94d59036ca5ee1caff2a0"},"schema_version":"1.0"},"canonical_sha256":"80b12079353084d5b55565b0a9104607e985c777cc0c7f97132a8aa390314321","source":{"kind":"arxiv","id":"1110.3107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3107","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3107v2","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3107","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"QCYSA6JVGCCN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QCYSA6JVGCCNLNKV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QCYSA6JV","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QCYSA6JVGCCNLNKVMWYKSECGA7","target":"record","payload":{"canonical_record":{"source":{"id":"1110.3107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-14T02:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"adfc449da58d2ed03d747b080bdf717b275b1fa3a7720d6b3507f6adf6b450b2","abstract_canon_sha256":"fb302d0a1aefe7ec0b449024a14f2f618dd6d32656a94d59036ca5ee1caff2a0"},"schema_version":"1.0"},"canonical_sha256":"80b12079353084d5b55565b0a9104607e985c777cc0c7f97132a8aa390314321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:22.814509Z","signature_b64":"1yb2YhjugqgdayruV1FuZnk02+q/2RSd0YvoH7NVeTgfK91hw+9ugUOrRTOGSMJEybZWOavkVSxkOGrhFq7HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b12079353084d5b55565b0a9104607e985c777cc0c7f97132a8aa390314321","last_reissued_at":"2026-05-18T02:32:22.814131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:22.814131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.3107","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"392tRUNmF3jOtTTWOT4SkLn6NYhPIvQMnJ8HqATahkOqiG874X3/lo7xKPN17ox9Qf/l6WsOJv1P6oZ2ampoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:47:09.141234Z"},"content_sha256":"6a2d79f37e226c86fa7b47df0b9375bcded7f665e21ab6b052ae3044e481c63a","schema_version":"1.0","event_id":"sha256:6a2d79f37e226c86fa7b47df0b9375bcded7f665e21ab6b052ae3044e481c63a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QCYSA6JVGCCNLNKVMWYKSECGA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some inequalities for orderings of acyclic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imed Zaguia, Thomas Bier","submitted_at":"2011-10-14T02:02:41Z","abstract_excerpt":"Let $D=(V,A)$ be an acyclic digraph. For $x\\in V$ define $e_{_{D}}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is a one-to-one map $g: V \\rightarrow [1,|V|] $ that has the property that for all $x,y\\in V$ if $(x,y)\\in A$, then $g(x) < g(y)$.\n  We prove that for every acyclic ordering $g$ of $D$ the following inequality holds: \\[\\sum_{x\\in V} e_{_{D}}(x)\\cdot g(x) ~\\geq~ \\frac{1}{2} \\sum_{x\\in V}[e_{_{D}}(x)]^2~.\\] The class of acyclic digraphs for which equality holds is determined as the class of comparbility digraphs of posets"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3107","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3844s5Wxfi6ZQJLWwPruEyXqQ1FXXD0a/Bdc4sQF8RMC442nrgSQfEzutO0V880mCSbjtV8IouavVgIyzIQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:47:09.141605Z"},"content_sha256":"91458acd068c872e3d7dcfb0c886a61b886cf3f25b4a61873f936fa98a547c75","schema_version":"1.0","event_id":"sha256:91458acd068c872e3d7dcfb0c886a61b886cf3f25b4a61873f936fa98a547c75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCYSA6JVGCCNLNKVMWYKSECGA7/bundle.json","state_url":"https://pith.science/pith/QCYSA6JVGCCNLNKVMWYKSECGA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCYSA6JVGCCNLNKVMWYKSECGA7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T11:47:09Z","links":{"resolver":"https://pith.science/pith/QCYSA6JVGCCNLNKVMWYKSECGA7","bundle":"https://pith.science/pith/QCYSA6JVGCCNLNKVMWYKSECGA7/bundle.json","state":"https://pith.science/pith/QCYSA6JVGCCNLNKVMWYKSECGA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCYSA6JVGCCNLNKVMWYKSECGA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QCYSA6JVGCCNLNKVMWYKSECGA7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fb302d0a1aefe7ec0b449024a14f2f618dd6d32656a94d59036ca5ee1caff2a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-14T02:02:41Z","title_canon_sha256":"adfc449da58d2ed03d747b080bdf717b275b1fa3a7720d6b3507f6adf6b450b2"},"schema_version":"1.0","source":{"id":"1110.3107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3107","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3107v2","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3107","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"QCYSA6JVGCCN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QCYSA6JVGCCNLNKV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QCYSA6JV","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:91458acd068c872e3d7dcfb0c886a61b886cf3f25b4a61873f936fa98a547c75","target":"graph","created_at":"2026-05-18T02:32:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $D=(V,A)$ be an acyclic digraph. For $x\\in V$ define $e_{_{D}}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is a one-to-one map $g: V \\rightarrow [1,|V|] $ that has the property that for all $x,y\\in V$ if $(x,y)\\in A$, then $g(x) < g(y)$.\n  We prove that for every acyclic ordering $g$ of $D$ the following inequality holds: \\[\\sum_{x\\in V} e_{_{D}}(x)\\cdot g(x) ~\\geq~ \\frac{1}{2} \\sum_{x\\in V}[e_{_{D}}(x)]^2~.\\] The class of acyclic digraphs for which equality holds is determined as the class of comparbility digraphs of posets","authors_text":"Imed Zaguia, Thomas Bier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-14T02:02:41Z","title":"Some inequalities for orderings of acyclic digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3107","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6a2d79f37e226c86fa7b47df0b9375bcded7f665e21ab6b052ae3044e481c63a","target":"record","created_at":"2026-05-18T02:32:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fb302d0a1aefe7ec0b449024a14f2f618dd6d32656a94d59036ca5ee1caff2a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-14T02:02:41Z","title_canon_sha256":"adfc449da58d2ed03d747b080bdf717b275b1fa3a7720d6b3507f6adf6b450b2"},"schema_version":"1.0","source":{"id":"1110.3107","kind":"arxiv","version":2}},"canonical_sha256":"80b12079353084d5b55565b0a9104607e985c777cc0c7f97132a8aa390314321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80b12079353084d5b55565b0a9104607e985c777cc0c7f97132a8aa390314321","first_computed_at":"2026-05-18T02:32:22.814131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:22.814131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1yb2YhjugqgdayruV1FuZnk02+q/2RSd0YvoH7NVeTgfK91hw+9ugUOrRTOGSMJEybZWOavkVSxkOGrhFq7HDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:22.814509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a2d79f37e226c86fa7b47df0b9375bcded7f665e21ab6b052ae3044e481c63a","sha256:91458acd068c872e3d7dcfb0c886a61b886cf3f25b4a61873f936fa98a547c75"],"state_sha256":"d02704cfe008ec99a5f6bac794fa38a0d34eb252cb087577a5fa938c7265b440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlmsUD/Ch0jSOmQwthS7c0zFq1TEk+oiqm8OffCovU27vnn7WrsqaDjXz7qdV3uCOR0f4E9YziV8y6QWBbdjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:47:09.143531Z","bundle_sha256":"01a9706afa293d7c16824dac63a8a58add4985c30b57e2f230394ff98d62414b"}}