{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BEDPAEP3IIQI4EYPRT3PDV67HE","short_pith_number":"pith:BEDPAEP3","schema_version":"1.0","canonical_sha256":"0906f011fb42208e130f8cf6f1d7df392f2991ed09f5b2aa0206dd17f63bd23d","source":{"kind":"arxiv","id":"2605.16852","version":1},"attestation_state":"computed","paper":{"title":"Span capacities of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The d-capacity counts the maximum players who can simultaneously traverse every vertex of a graph while staying at least d apart, reaching the theoretical maximum for d=1 exactly when the graph is topfull.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aljo\\v{s}a \\v{S}uba\\v{s}i\\'c, Andrej Taranenko, Christopher Mouron, Mateja Gra\\v{s}i\\v{c}, Tanja Vojkovi\\'c","submitted_at":"2026-05-16T07:32:36Z","abstract_excerpt":"The $d$-capacity of a graph $G$ is introduced as the maximum number of players that can simultaneously traverse $G$ such that each player visits all vertices while maintaining a distance of at least $d$ under various movement rules. We determine their values for paths and cycles and provide bounds for bipartite graphs. Furthermore, we characterize topfull graphs, where the 1-capacities reach their theoretical maximum, establishing a connection to graph factorizations and connectivity."},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16852","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T07:32:36Z","cross_cats_sorted":[],"title_canon_sha256":"9351c362895ad27e24b5b3469c90d9047c445891afeeaf6326ede9e39690b12d","abstract_canon_sha256":"9be05aa751fb242be0b7ccdd0e48049299832f242632d4cb53c05954fc79d000"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:26.258740Z","signature_b64":"Wf3EyzdGXZ/cdYICMQWFIOxt37fs+d3CfxJNTfANfttE0PJysfo37XKBWScUwT4WRggbZ6H8lmmMRvSCpg/sCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0906f011fb42208e130f8cf6f1d7df392f2991ed09f5b2aa0206dd17f63bd23d","last_reissued_at":"2026-05-20T00:03:26.257797Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:26.257797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Span capacities of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The d-capacity counts the maximum players who can simultaneously traverse every vertex of a graph while staying at least d apart, reaching the theoretical maximum for d=1 exactly when the graph is topfull.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aljo\\v{s}a \\v{S}uba\\v{s}i\\'c, Andrej Taranenko, Christopher Mouron, Mateja Gra\\v{s}i\\v{c}, Tanja Vojkovi\\'c","submitted_at":"2026-05-16T07:32:36Z","abstract_excerpt":"The $d$-capacity of a graph $G$ is introduced as the maximum number of players that can simultaneously traverse $G$ such that each player visits all vertices while maintaining a distance of at least $d$ under various movement rules. We determine their values for paths and cycles and provide bounds for bipartite graphs. Furthermore, we characterize topfull graphs, where the 1-capacities reach their theoretical maximum, establishing a connection to graph factorizations and connectivity."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We characterize topfull graphs, where the 1-capacities reach their theoretical maximum, establishing a connection to graph factorizations and connectivity.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The movement rules under which players traverse the graph are assumed to be defined so that a finite maximum number of simultaneous traversals exists and can be attained for the graph classes studied (paths, cycles, bipartite graphs, and topfull graphs).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Defines d-capacity for graphs, computes exact values for paths and cycles, gives bounds for bipartite graphs, and characterizes topfull graphs via factorizations and connectivity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The d-capacity counts the maximum players who can simultaneously traverse every vertex of a graph while staying at least d apart, reaching the theoretical maximum for d=1 exactly when the graph is topfull.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"97658556256f6d2e06fef44e764320596c32129087c61ffe5c306de4746c67bb"},"source":{"id":"2605.16852","kind":"arxiv","version":1},"verdict":{"id":"2960ca8c-8678-4ca9-a1d4-cbc527e5bca9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:46:30.713946Z","strongest_claim":"We characterize topfull graphs, where the 1-capacities reach their theoretical maximum, establishing a connection to graph factorizations and connectivity.","one_line_summary":"Defines d-capacity for graphs, computes exact values for paths and cycles, gives bounds for bipartite graphs, and characterizes topfull graphs via factorizations and connectivity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The movement rules under which players traverse the graph are assumed to be defined so that a finite maximum number of simultaneous traversals exists and can be attained for the graph classes studied (paths, cycles, bipartite graphs, and topfull graphs).","pith_extraction_headline":"The d-capacity counts the maximum players who can simultaneously traverse every vertex of a graph while staying at least d apart, reaching the theoretical maximum for d=1 exactly when the graph is topfull."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16852/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T21:01:25.061703Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.240758Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.312755Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.386798Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c5b66166f9d6dd4ab3f05840783ba7a56e81e9ac734628f25a46039d23e96302"},"references":{"count":12,"sample":[{"doi":"","year":2023,"title":"Baniˇ c and A","work_id":"9e9149e9-b5b8-4c30-9c6e-a11f91f65ac1","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"T. Dravec, M. Mikalaˇ cki, and A. Taranenko. Graphs with span 1 and shortest optimal walks.Appl. Math. Comput., 500:129433, 2025","work_id":"56ef3007-f06a-42a8-abce-b8fc0e1c06d1","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"G. Erceg, A. ˇSubaˇ si´ c, and T. Vojkovi´ c. Some results on the maximal safety distance in a graph.Filomat, 37(15):5123–5136, 2023","work_id":"4ea45e23-07a8-4572-9760-351e6bc72980","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Graˇ siˇ c, C","work_id":"209749d8-6b7d-4aa7-a0c9-3a1a582e082b","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Lov´ asz and M","work_id":"1dd1be4c-de85-4ca2-a153-a1d667965a04","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"697428131da0730c07a7eb91e3c8b9b947b9fcbae7005f5a1a1d77312d00ea0f","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"384f4faf5b66f9949ddcadfdbab2562342798e3d0fa5a08393787f378a68e060"},"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":"2605.16852","created_at":"2026-05-20T00:03:26.257932+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16852v1","created_at":"2026-05-20T00:03:26.257932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16852","created_at":"2026-05-20T00:03:26.257932+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEDPAEP3IIQI","created_at":"2026-05-20T00:03:26.257932+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEDPAEP3IIQI4EYP","created_at":"2026-05-20T00:03:26.257932+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEDPAEP3","created_at":"2026-05-20T00:03:26.257932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE","json":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE.json","graph_json":"https://pith.science/api/pith-number/BEDPAEP3IIQI4EYPRT3PDV67HE/graph.json","events_json":"https://pith.science/api/pith-number/BEDPAEP3IIQI4EYPRT3PDV67HE/events.json","paper":"https://pith.science/paper/BEDPAEP3"},"agent_actions":{"view_html":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE","download_json":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE.json","view_paper":"https://pith.science/paper/BEDPAEP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16852&json=true","fetch_graph":"https://pith.science/api/pith-number/BEDPAEP3IIQI4EYPRT3PDV67HE/graph.json","fetch_events":"https://pith.science/api/pith-number/BEDPAEP3IIQI4EYPRT3PDV67HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE/action/storage_attestation","attest_author":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE/action/author_attestation","sign_citation":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE/action/citation_signature","submit_replication":"https://pith.science/pith/BEDPAEP3IIQI4EYPRT3PDV67HE/action/replication_record"}},"created_at":"2026-05-20T00:03:26.257932+00:00","updated_at":"2026-05-20T00:03:26.257932+00:00"}