{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:P6VQXOH4FE7XLSN6OB7YEUCM5T","short_pith_number":"pith:P6VQXOH4","schema_version":"1.0","canonical_sha256":"7fab0bb8fc293f75c9be707f82504cecc3588f5ee27e28a3776b07fff1fd2d7b","source":{"kind":"arxiv","id":"2009.03295","version":1},"attestation_state":"computed","paper":{"title":"Ends of digraphs I: basic theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl B\\\"urger, Ruben Melcher","submitted_at":"2020-09-07T17:55:27Z","abstract_excerpt":"In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit edges; these are crucial for obtaining the end space of a digraph as a natural (inverse) limit of its finite contraction minors. As our main result in this first paper of our series we show that the notion of directions of an undirected graph, a tangle-like description of its ends, extends to digraphs: there is a one-to-one correspondence between the `directi"},"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":"2009.03295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-07T17:55:27Z","cross_cats_sorted":[],"title_canon_sha256":"04b39e21b0c8b1656c9efd3e2aaf70349f43e0e192eb60212621e7102b685007","abstract_canon_sha256":"e36e25e20f580cbe20ad7faaad1343cfac35cc7e12f3ad9ce6b32962c7a8f511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:31.804772Z","signature_b64":"sbUYJlkhF6ZWZIwB7Cm5lnofEOXNvBKKM0Hmf39D0S0beII+smc7KRy7dRmZg3cWmPX5E9+vziR6ihoQRxnkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fab0bb8fc293f75c9be707f82504cecc3588f5ee27e28a3776b07fff1fd2d7b","last_reissued_at":"2026-07-05T01:33:31.804348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:31.804348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ends of digraphs I: basic theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl B\\\"urger, Ruben Melcher","submitted_at":"2020-09-07T17:55:27Z","abstract_excerpt":"In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit edges; these are crucial for obtaining the end space of a digraph as a natural (inverse) limit of its finite contraction minors. As our main result in this first paper of our series we show that the notion of directions of an undirected graph, a tangle-like description of its ends, extends to digraphs: there is a one-to-one correspondence between the `directi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03295","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.03295/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.03295","created_at":"2026-07-05T01:33:31.804405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.03295v1","created_at":"2026-07-05T01:33:31.804405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03295","created_at":"2026-07-05T01:33:31.804405+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6VQXOH4FE7X","created_at":"2026-07-05T01:33:31.804405+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6VQXOH4FE7XLSN6","created_at":"2026-07-05T01:33:31.804405+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6VQXOH4","created_at":"2026-07-05T01:33:31.804405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03482","citing_title":"Halin's grid theorem for digraphs","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T","json":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T.json","graph_json":"https://pith.science/api/pith-number/P6VQXOH4FE7XLSN6OB7YEUCM5T/graph.json","events_json":"https://pith.science/api/pith-number/P6VQXOH4FE7XLSN6OB7YEUCM5T/events.json","paper":"https://pith.science/paper/P6VQXOH4"},"agent_actions":{"view_html":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T","download_json":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T.json","view_paper":"https://pith.science/paper/P6VQXOH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.03295&json=true","fetch_graph":"https://pith.science/api/pith-number/P6VQXOH4FE7XLSN6OB7YEUCM5T/graph.json","fetch_events":"https://pith.science/api/pith-number/P6VQXOH4FE7XLSN6OB7YEUCM5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T/action/storage_attestation","attest_author":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T/action/author_attestation","sign_citation":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T/action/citation_signature","submit_replication":"https://pith.science/pith/P6VQXOH4FE7XLSN6OB7YEUCM5T/action/replication_record"}},"created_at":"2026-07-05T01:33:31.804405+00:00","updated_at":"2026-07-05T01:33:31.804405+00:00"}