{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7V3VJ4LOGSNFSLCMAJTG2GCABC","short_pith_number":"pith:7V3VJ4LO","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"},"canonical_sha256":"fd7754f16e349a592c4c02666d1840088725e5c4e3534b7106926fcb4b8e1834","source":{"kind":"arxiv","id":"1609.02210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02210","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02210v1","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02210","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"7V3VJ4LOGSNF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7V3VJ4LOGSNFSLCM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7V3VJ4LO","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7V3VJ4LOGSNFSLCMAJTG2GCABC","target":"record","payload":{"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"},"canonical_sha256":"fd7754f16e349a592c4c02666d1840088725e5c4e3534b7106926fcb4b8e1834","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"},"source_kind":"arxiv","source_id":"1609.02210","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlNeyyXNS/6pi0aPg+xwujY0eVBT/tjxbQEXTL40D5/Pnn2nHmIC3fvrzn0ZS+2fNdlVvJEretmR1t48zeYVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:36:16.464997Z"},"content_sha256":"249d1850cbea3b5868af9cb490fa735d2e754ee3a0a320387c5993ec45dfafa5","schema_version":"1.0","event_id":"sha256:249d1850cbea3b5868af9cb490fa735d2e754ee3a0a320387c5993ec45dfafa5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7V3VJ4LOGSNFSLCMAJTG2GCABC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWbp6LFn6guAU4nEX2K/v+q5aLauiygryXnaOXanCPidntah6o285eGB0hvZ2AY/UDZsAJwHQw8DPeEyEscHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:36:16.465374Z"},"content_sha256":"eba58e66b99926b0ab7b96351438ebe4e3efa8c4f81a484bcdac48e1a33f05d6","schema_version":"1.0","event_id":"sha256:eba58e66b99926b0ab7b96351438ebe4e3efa8c4f81a484bcdac48e1a33f05d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/bundle.json","state_url":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T20:36:16Z","links":{"resolver":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC","bundle":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/bundle.json","state":"https://pith.science/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7V3VJ4LOGSNFSLCMAJTG2GCABC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7V3VJ4LOGSNFSLCMAJTG2GCABC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"504e0d104471ecb16c7f5da128ae7ae8cac1adfcd29afd1b016affa2412925ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-07T22:22:12Z","title_canon_sha256":"bdaf61f992fec616cff8020b5192fb26fb3a442d2690412e52f9fde4a1add6c7"},"schema_version":"1.0","source":{"id":"1609.02210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02210","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02210v1","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02210","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"7V3VJ4LOGSNF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7V3VJ4LOGSNFSLCM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7V3VJ4LO","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:eba58e66b99926b0ab7b96351438ebe4e3efa8c4f81a484bcdac48e1a33f05d6","target":"graph","created_at":"2026-05-18T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"John Asplund, N. Bradley Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-07T22:22:12Z","title":"Enumerating cycles in the graph of overlapping permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02210","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:249d1850cbea3b5868af9cb490fa735d2e754ee3a0a320387c5993ec45dfafa5","target":"record","created_at":"2026-05-18T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"504e0d104471ecb16c7f5da128ae7ae8cac1adfcd29afd1b016affa2412925ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-07T22:22:12Z","title_canon_sha256":"bdaf61f992fec616cff8020b5192fb26fb3a442d2690412e52f9fde4a1add6c7"},"schema_version":"1.0","source":{"id":"1609.02210","kind":"arxiv","version":1}},"canonical_sha256":"fd7754f16e349a592c4c02666d1840088725e5c4e3534b7106926fcb4b8e1834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd7754f16e349a592c4c02666d1840088725e5c4e3534b7106926fcb4b8e1834","first_computed_at":"2026-05-18T01:04:55.163307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:55.163307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pZ59YBxN5utMpUy3WwOChoI+E+q/jZi49KWFN9WTnkju13du/obNDesyZd9hn972crr00LbYmoDNgcJ6AZFNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:55.163842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:249d1850cbea3b5868af9cb490fa735d2e754ee3a0a320387c5993ec45dfafa5","sha256:eba58e66b99926b0ab7b96351438ebe4e3efa8c4f81a484bcdac48e1a33f05d6"],"state_sha256":"461d4b02cece78b3c8814d541c6fa97cee41def31246dd27eb8b5ce20678fc0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVuGx/T/go7yIV37Z8r8+qsqOGMNFDMmU+tTjcMs9siwseTkJONZRUAdltzZqmLNIS5UWg3KC7KBgf6XjIqNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T20:36:16.468434Z","bundle_sha256":"d93319fee1f9f3312ef7714d6dc8a0075e889b6a45a27ff8b5c911142fc684c6"}}