{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ARUZCUCUAOP3ZSSEXBTQ5QAGNF","short_pith_number":"pith:ARUZCUCU","schema_version":"1.0","canonical_sha256":"0469915054039fbcca44b8670ec006696d40ff5bcba7124eafef144afa9db893","source":{"kind":"arxiv","id":"1310.4141","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.4141","created_at":"2026-05-18T00:31:59.704364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4141v2","created_at":"2026-05-18T00:31:59.704364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4141","created_at":"2026-05-18T00:31:59.704364+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARUZCUCUAOP3","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARUZCUCUAOP3ZSSE","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARUZCUCU","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF","json":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF.json","graph_json":"https://pith.science/api/pith-number/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/graph.json","events_json":"https://pith.science/api/pith-number/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/events.json","paper":"https://pith.science/paper/ARUZCUCU"},"agent_actions":{"view_html":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF","download_json":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF.json","view_paper":"https://pith.science/paper/ARUZCUCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4141&json=true","fetch_graph":"https://pith.science/api/pith-number/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/graph.json","fetch_events":"https://pith.science/api/pith-number/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/action/storage_attestation","attest_author":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/action/author_attestation","sign_citation":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/action/citation_signature","submit_replication":"https://pith.science/pith/ARUZCUCUAOP3ZSSEXBTQ5QAGNF/action/replication_record"}},"created_at":"2026-05-18T00:31:59.704364+00:00","updated_at":"2026-05-18T00:31:59.704364+00:00"}