{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7V3VJ4LOGSNFSLCMAJTG2GCABC","short_pith_number":"pith:7V3VJ4LO","schema_version":"1.0","canonical_sha256":"fd7754f16e349a592c4c02666d1840088725e5c4e3534b7106926fcb4b8e1834","source":{"kind":"arxiv","id":"1609.02210","version":1},"attestation_state":"computed","paper":{"title":"Enumerating cycles in the graph of overlapping permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Asplund, N. Bradley Fox","submitted_at":"2016-09-07T22:22:12Z","abstract_excerpt":"The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\\cdots a_{n+1}$ would connect the standardization of $a_1\\cdots a_n$ to the standardization of $a_2\\cdots a_{n+1}$. We examine properties of this graph to determine where directed cycles can exist, to count the number of directed $2$-cycles within the graph, and to enumerate the vertices that are contained within closed walks and directed cycles of more general lengt"},"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":"1609.02210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-07T22:22:12Z","cross_cats_sorted":[],"title_canon_sha256":"bdaf61f992fec616cff8020b5192fb26fb3a442d2690412e52f9fde4a1add6c7","abstract_canon_sha256":"504e0d104471ecb16c7f5da128ae7ae8cac1adfcd29afd1b016affa2412925ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:55.163842Z","signature_b64":"pZ59YBxN5utMpUy3WwOChoI+E+q/jZi49KWFN9WTnkju13du/obNDesyZd9hn972crr00LbYmoDNgcJ6AZFNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7754f16e349a592c4c02666d1840088725e5c4e3534b7106926fcb4b8e1834","last_reissued_at":"2026-05-18T01:04:55.163307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:55.163307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating cycles in the graph of overlapping permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Asplund, N. Bradley Fox","submitted_at":"2016-09-07T22:22:12Z","abstract_excerpt":"The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\\cdots a_{n+1}$ would connect the standardization of $a_1\\cdots a_n$ to the standardization of $a_2\\cdots a_{n+1}$. We examine properties of this graph to determine where directed cycles can exist, to count the number of directed $2$-cycles within the graph, and to enumerate the vertices that are contained within closed walks and directed cycles of more general lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02210","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":"1609.02210","created_at":"2026-05-18T01:04:55.163395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02210v1","created_at":"2026-05-18T01:04:55.163395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02210","created_at":"2026-05-18T01:04:55.163395+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V3VJ4LOGSNF","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V3VJ4LOGSNFSLCM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V3VJ4LO","created_at":"2026-05-18T12:30:04.600751+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/7V3VJ4LOGSNFSLCMAJTG2GCABC","json":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC.json","graph_json":"https://pith.science/api/pith-number/7V3VJ4LOGSNFSLCMAJTG2GCABC/graph.json","events_json":"https://pith.science/api/pith-number/7V3VJ4LOGSNFSLCMAJTG2GCABC/events.json","paper":"https://pith.science/paper/7V3VJ4LO"},"agent_actions":{"view_html":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC","download_json":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC.json","view_paper":"https://pith.science/paper/7V3VJ4LO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02210&json=true","fetch_graph":"https://pith.science/api/pith-number/7V3VJ4LOGSNFSLCMAJTG2GCABC/graph.json","fetch_events":"https://pith.science/api/pith-number/7V3VJ4LOGSNFSLCMAJTG2GCABC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/action/storage_attestation","attest_author":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/action/author_attestation","sign_citation":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/action/citation_signature","submit_replication":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/action/replication_record"}},"created_at":"2026-05-18T01:04:55.163395+00:00","updated_at":"2026-05-18T01:04:55.163395+00:00"}