{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FXWJT7ASG7JGW2XRUACRT7CEMN","short_pith_number":"pith:FXWJT7AS","schema_version":"1.0","canonical_sha256":"2dec99fc1237d26b6af1a00519fc44636794746ba2c5f5b6c5c13f27cb69bce6","source":{"kind":"arxiv","id":"1307.0992","version":4},"attestation_state":"computed","paper":{"title":"Edge-disjoint double rays in infinite graphs: a Halin type result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Julian Pott, Nathan Bowler","submitted_at":"2013-07-03T12:41:20Z","abstract_excerpt":"We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981."},"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":"1307.0992","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-03T12:41:20Z","cross_cats_sorted":[],"title_canon_sha256":"e6fcbfd8c3be7b28fe0455bca06d6bd08963bdc531e2826435535fd8627d08f3","abstract_canon_sha256":"f45a21db3977343e5f48d29db4579ef6997cd144c63bd68823cfef6ca8a3d30a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:55.953699Z","signature_b64":"YggRFgU63fCVhlcQWhNlloO0Kmv4a6AwOxMw7OU7AKKcGsHLwq6NpxZ0RS3O0+eyFIwhYGXbqZPJgkg8VNvRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dec99fc1237d26b6af1a00519fc44636794746ba2c5f5b6c5c13f27cb69bce6","last_reissued_at":"2026-05-18T02:45:55.953114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:55.953114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-disjoint double rays in infinite graphs: a Halin type result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Julian Pott, Nathan Bowler","submitted_at":"2013-07-03T12:41:20Z","abstract_excerpt":"We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0992","kind":"arxiv","version":4},"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":"1307.0992","created_at":"2026-05-18T02:45:55.953192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0992v4","created_at":"2026-05-18T02:45:55.953192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0992","created_at":"2026-05-18T02:45:55.953192+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXWJT7ASG7JG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXWJT7ASG7JGW2XR","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXWJT7AS","created_at":"2026-05-18T12:27:45.050594+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/FXWJT7ASG7JGW2XRUACRT7CEMN","json":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN.json","graph_json":"https://pith.science/api/pith-number/FXWJT7ASG7JGW2XRUACRT7CEMN/graph.json","events_json":"https://pith.science/api/pith-number/FXWJT7ASG7JGW2XRUACRT7CEMN/events.json","paper":"https://pith.science/paper/FXWJT7AS"},"agent_actions":{"view_html":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN","download_json":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN.json","view_paper":"https://pith.science/paper/FXWJT7AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0992&json=true","fetch_graph":"https://pith.science/api/pith-number/FXWJT7ASG7JGW2XRUACRT7CEMN/graph.json","fetch_events":"https://pith.science/api/pith-number/FXWJT7ASG7JGW2XRUACRT7CEMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN/action/storage_attestation","attest_author":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN/action/author_attestation","sign_citation":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN/action/citation_signature","submit_replication":"https://pith.science/pith/FXWJT7ASG7JGW2XRUACRT7CEMN/action/replication_record"}},"created_at":"2026-05-18T02:45:55.953192+00:00","updated_at":"2026-05-18T02:45:55.953192+00:00"}