{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AEZGRNJ7AZTHIBARTXYMKXW7LC","short_pith_number":"pith:AEZGRNJ7","schema_version":"1.0","canonical_sha256":"013268b53f06667404119df0c55edf58ab02c6660dbe6c6515560eba7412c436","source":{"kind":"arxiv","id":"2409.02306","version":1},"attestation_state":"computed","paper":{"title":"Limits and Periodicity of Metamour $2$-Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Herden, Jonathan Meddaugh, Kyle Rosengartner, Mark R. Sepanski, Mitchell Minyard, William Q. Erickson","submitted_at":"2024-09-03T21:32:23Z","abstract_excerpt":"Given a finite simple graph $G$, let $\\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \\operatorname{M}(G), \\operatorname{M}^2(G), \\operatorname{M}^3(G), \\ldots$ obtained by iterating the 2-distance operation. In particular, we classify the connected graphs with period 3, and we partially characterize those with period 2. We then study two families of graphs whose 2-distance sequence is eventually periodic: namely, generalized Petersen graphs and "},"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":"2409.02306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T21:32:23Z","cross_cats_sorted":[],"title_canon_sha256":"a501aae1275d7d5c463d3f57381778734431c34e84f6aa5c74c6b9625720a2ae","abstract_canon_sha256":"c273cc3c0ec0f126147020bff5128740ffb91a66ba0ab60853b8a7c33d4be4a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:45.604668Z","signature_b64":"cKJEonBuYMfEoRqXJIL7+KP62mqIRlhToopUloLMWgbI1RkqXybi4q26lijE8cS9uYMqiib6FleYtbYdR12tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"013268b53f06667404119df0c55edf58ab02c6660dbe6c6515560eba7412c436","last_reissued_at":"2026-07-05T09:02:45.604162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:45.604162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limits and Periodicity of Metamour $2$-Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Herden, Jonathan Meddaugh, Kyle Rosengartner, Mark R. Sepanski, Mitchell Minyard, William Q. Erickson","submitted_at":"2024-09-03T21:32:23Z","abstract_excerpt":"Given a finite simple graph $G$, let $\\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \\operatorname{M}(G), \\operatorname{M}^2(G), \\operatorname{M}^3(G), \\ldots$ obtained by iterating the 2-distance operation. In particular, we classify the connected graphs with period 3, and we partially characterize those with period 2. We then study two families of graphs whose 2-distance sequence is eventually periodic: namely, generalized Petersen graphs and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02306","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/2409.02306/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":"2409.02306","created_at":"2026-07-05T09:02:45.604231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02306v1","created_at":"2026-07-05T09:02:45.604231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02306","created_at":"2026-07-05T09:02:45.604231+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEZGRNJ7AZTH","created_at":"2026-07-05T09:02:45.604231+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEZGRNJ7AZTHIBAR","created_at":"2026-07-05T09:02:45.604231+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEZGRNJ7","created_at":"2026-07-05T09:02:45.604231+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/AEZGRNJ7AZTHIBARTXYMKXW7LC","json":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC.json","graph_json":"https://pith.science/api/pith-number/AEZGRNJ7AZTHIBARTXYMKXW7LC/graph.json","events_json":"https://pith.science/api/pith-number/AEZGRNJ7AZTHIBARTXYMKXW7LC/events.json","paper":"https://pith.science/paper/AEZGRNJ7"},"agent_actions":{"view_html":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC","download_json":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC.json","view_paper":"https://pith.science/paper/AEZGRNJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02306&json=true","fetch_graph":"https://pith.science/api/pith-number/AEZGRNJ7AZTHIBARTXYMKXW7LC/graph.json","fetch_events":"https://pith.science/api/pith-number/AEZGRNJ7AZTHIBARTXYMKXW7LC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC/action/storage_attestation","attest_author":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC/action/author_attestation","sign_citation":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC/action/citation_signature","submit_replication":"https://pith.science/pith/AEZGRNJ7AZTHIBARTXYMKXW7LC/action/replication_record"}},"created_at":"2026-07-05T09:02:45.604231+00:00","updated_at":"2026-07-05T09:02:45.604231+00:00"}