{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ARUZCUCUAOP3ZSSEXBTQ5QAGNF","short_pith_number":"pith:ARUZCUCU","canonical_record":{"source":{"id":"1310.4141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-15T18:41:31Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"4edeef1828e0accda1001e2cf01c7a57301b933737ef4c0d40a4dadf53ac7f6e","abstract_canon_sha256":"950890fc74ebc44b7f1d7f9097d85199d6d359d0316dac8db58013f51495fe47"},"schema_version":"1.0"},"canonical_sha256":"0469915054039fbcca44b8670ec006696d40ff5bcba7124eafef144afa9db893","source":{"kind":"arxiv","id":"1310.4141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4141","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4141v2","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4141","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"ARUZCUCUAOP3","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ARUZCUCUAOP3ZSSE","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ARUZCUCU","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ARUZCUCUAOP3ZSSEXBTQ5QAGNF","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-15T18:41:31Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"4edeef1828e0accda1001e2cf01c7a57301b933737ef4c0d40a4dadf53ac7f6e","abstract_canon_sha256":"950890fc74ebc44b7f1d7f9097d85199d6d359d0316dac8db58013f51495fe47"},"schema_version":"1.0"},"canonical_sha256":"0469915054039fbcca44b8670ec006696d40ff5bcba7124eafef144afa9db893","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:59.704761Z","signature_b64":"w3TwoKYqulHtVLy47JwY6WN3cu9J2xgQ2f3NTMrOU1fJacA0wHE8o53xqhiFaEUEYnwPIbP6ySPofIoi2Zi7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0469915054039fbcca44b8670ec006696d40ff5bcba7124eafef144afa9db893","last_reissued_at":"2026-05-18T00:31:59.704287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:59.704287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4141","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-18T00:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsnsGxbAeUiiXSmXCGm0Jtogbjjzu1SXNDsUWO0o6yp26FYiFWPBOJ/4hfDHKMgkkoR5MYFqgyhsir7LKx5ABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:44:05.793133Z"},"content_sha256":"b96be0ee8b41730839138fa8218d84876eccd36e9fa1ab53320ac6935b461d3d","schema_version":"1.0","event_id":"sha256:b96be0ee8b41730839138fa8218d84876eccd36e9fa1ab53320ac6935b461d3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ARUZCUCUAOP3ZSSEXBTQ5QAGNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological Additive Numbering of Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Daniel Severin, Javier Marenco, Marcelo Mydlarz","submitted_at":"2013-10-15T18:41:31Z","abstract_excerpt":"We propose to study a problem that arises naturally from both Topological Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as Lucky Labeling). Let $D$ be a digraph and $f$ a labeling of its vertices with positive integers; denote by $S(v)$ the sum of labels over all neighbors of each vertex $v$. The labeling $f$ is called \\emph{topological additive numbering} if $S(u) < S(v)$ for each arc $(u,v)$ of the digraph. The problem asks to find the minimum number $k$ for which $D$ has a topological additive numbering with labels belonging to $\\{ 1, \\ldots, k \\}$, denoted by $\\et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4141","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-18T00:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXTK+xmjWY0E4wgtshWPS6TsOF/h5qy3BMZPXgsEsJkqTJvOmbwPeZxGD0ND4vUW+BtqbjzfS8pADcX6WWP5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:44:05.793514Z"},"content_sha256":"1696dc7f063c26d52d5b3697289a59270bb13fa4243f530944c142e7dae444fc","schema_version":"1.0","event_id":"sha256:1696dc7f063c26d52d5b3697289a59270bb13fa4243f530944c142e7dae444fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/bundle.json","state_url":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/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-02T03:44:05Z","links":{"resolver":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF","bundle":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/bundle.json","state":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ARUZCUCUAOP3ZSSEXBTQ5QAGNF","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":"950890fc74ebc44b7f1d7f9097d85199d6d359d0316dac8db58013f51495fe47","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-15T18:41:31Z","title_canon_sha256":"4edeef1828e0accda1001e2cf01c7a57301b933737ef4c0d40a4dadf53ac7f6e"},"schema_version":"1.0","source":{"id":"1310.4141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4141","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4141v2","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4141","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"ARUZCUCUAOP3","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ARUZCUCUAOP3ZSSE","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ARUZCUCU","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:1696dc7f063c26d52d5b3697289a59270bb13fa4243f530944c142e7dae444fc","target":"graph","created_at":"2026-05-18T00:31:59Z","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":"We propose to study a problem that arises naturally from both Topological Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as Lucky Labeling). Let $D$ be a digraph and $f$ a labeling of its vertices with positive integers; denote by $S(v)$ the sum of labels over all neighbors of each vertex $v$. The labeling $f$ is called \\emph{topological additive numbering} if $S(u) < S(v)$ for each arc $(u,v)$ of the digraph. The problem asks to find the minimum number $k$ for which $D$ has a topological additive numbering with labels belonging to $\\{ 1, \\ldots, k \\}$, denoted by $\\et","authors_text":"Daniel Severin, Javier Marenco, Marcelo Mydlarz","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-15T18:41:31Z","title":"Topological Additive Numbering of Directed Acyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4141","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:b96be0ee8b41730839138fa8218d84876eccd36e9fa1ab53320ac6935b461d3d","target":"record","created_at":"2026-05-18T00:31:59Z","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":"950890fc74ebc44b7f1d7f9097d85199d6d359d0316dac8db58013f51495fe47","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-15T18:41:31Z","title_canon_sha256":"4edeef1828e0accda1001e2cf01c7a57301b933737ef4c0d40a4dadf53ac7f6e"},"schema_version":"1.0","source":{"id":"1310.4141","kind":"arxiv","version":2}},"canonical_sha256":"0469915054039fbcca44b8670ec006696d40ff5bcba7124eafef144afa9db893","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0469915054039fbcca44b8670ec006696d40ff5bcba7124eafef144afa9db893","first_computed_at":"2026-05-18T00:31:59.704287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:59.704287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w3TwoKYqulHtVLy47JwY6WN3cu9J2xgQ2f3NTMrOU1fJacA0wHE8o53xqhiFaEUEYnwPIbP6ySPofIoi2Zi7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:59.704761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b96be0ee8b41730839138fa8218d84876eccd36e9fa1ab53320ac6935b461d3d","sha256:1696dc7f063c26d52d5b3697289a59270bb13fa4243f530944c142e7dae444fc"],"state_sha256":"70656c1f9f1e0a1cff0de375e449ed80336ddc093b022bb72993e1254b93c553"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZqZnwIa/HBb//H5qDGLOsW1ZQzcxM14vNBlpw6fZ43C36ZJ5fugzEqftESi7jiTyvBVe2ke0JH/EoUiEuBhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:44:05.795454Z","bundle_sha256":"bf9a7edf5fa21950f462e34b04a67b68950a0c8c50df8953ad1b329ddd47d8ef"}}