{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7NXWUFI57DJAMQ3RE6CQGPSVCY","short_pith_number":"pith:7NXWUFI5","schema_version":"1.0","canonical_sha256":"fb6f6a151df8d20643712785033e55161e1f61ceba9bbea935803cfc8128d1bc","source":{"kind":"arxiv","id":"1704.06577","version":1},"attestation_state":"computed","paper":{"title":"Infinite end-devouring sets of rays with prescribed start vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Pascal Gollin, Karl Heuer","submitted_at":"2017-04-21T14:50:29Z","abstract_excerpt":"We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of Georgakopoulos."},"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":"1704.06577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-21T14:50:29Z","cross_cats_sorted":[],"title_canon_sha256":"3b1062a219e6c2f74f64af7b21edb4817ba824c7b6f078e5f289d86f036e443c","abstract_canon_sha256":"ada4954c36b3a315d1ad135bf7ba378177645383d7d16e7bc0f6b1ea428bcd2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:59.340033Z","signature_b64":"qNhwPCF0xB40jfcS1BBu0uYiVGSVuPFuDss+Qu3sIeVN0MuS9roRhEIStLr2P5wD+gVM3vQ+HuYi+F930fGBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6f6a151df8d20643712785033e55161e1f61ceba9bbea935803cfc8128d1bc","last_reissued_at":"2026-05-18T00:45:59.339524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:59.339524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite end-devouring sets of rays with prescribed start vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Pascal Gollin, Karl Heuer","submitted_at":"2017-04-21T14:50:29Z","abstract_excerpt":"We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of Georgakopoulos."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06577","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":""},"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":"1704.06577","created_at":"2026-05-18T00:45:59.339615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06577v1","created_at":"2026-05-18T00:45:59.339615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06577","created_at":"2026-05-18T00:45:59.339615+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NXWUFI57DJA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NXWUFI57DJAMQ3R","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NXWUFI5","created_at":"2026-05-18T12:31:05.417338+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/7NXWUFI57DJAMQ3RE6CQGPSVCY","json":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY.json","graph_json":"https://pith.science/api/pith-number/7NXWUFI57DJAMQ3RE6CQGPSVCY/graph.json","events_json":"https://pith.science/api/pith-number/7NXWUFI57DJAMQ3RE6CQGPSVCY/events.json","paper":"https://pith.science/paper/7NXWUFI5"},"agent_actions":{"view_html":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY","download_json":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY.json","view_paper":"https://pith.science/paper/7NXWUFI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06577&json=true","fetch_graph":"https://pith.science/api/pith-number/7NXWUFI57DJAMQ3RE6CQGPSVCY/graph.json","fetch_events":"https://pith.science/api/pith-number/7NXWUFI57DJAMQ3RE6CQGPSVCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY/action/storage_attestation","attest_author":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY/action/author_attestation","sign_citation":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY/action/citation_signature","submit_replication":"https://pith.science/pith/7NXWUFI57DJAMQ3RE6CQGPSVCY/action/replication_record"}},"created_at":"2026-05-18T00:45:59.339615+00:00","updated_at":"2026-05-18T00:45:59.339615+00:00"}