{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PARO6GKYHGNELEOLBSI3IBNHXU","short_pith_number":"pith:PARO6GKY","canonical_record":{"source":{"id":"2302.13713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T12:21:19Z","cross_cats_sorted":[],"title_canon_sha256":"ad0441d3adfe60c9ba97c9c15fd141dcec4f5b27c39c8e394536d894aedd49d2","abstract_canon_sha256":"95c4e46f3ee68311b91724a612279c2d1721aa457560b2daa65e56c1aebcac00"},"schema_version":"1.0"},"canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","source":{"kind":"arxiv","id":"2302.13713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13713","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13713v1","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13713","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"PARO6GKYHGNE","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"pith_short_16","alias_value":"PARO6GKYHGNELEOL","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"pith_short_8","alias_value":"PARO6GKY","created_at":"2026-07-05T05:45:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PARO6GKYHGNELEOLBSI3IBNHXU","target":"record","payload":{"canonical_record":{"source":{"id":"2302.13713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T12:21:19Z","cross_cats_sorted":[],"title_canon_sha256":"ad0441d3adfe60c9ba97c9c15fd141dcec4f5b27c39c8e394536d894aedd49d2","abstract_canon_sha256":"95c4e46f3ee68311b91724a612279c2d1721aa457560b2daa65e56c1aebcac00"},"schema_version":"1.0"},"canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:49.916954Z","signature_b64":"QIxBaKRnftjlVQJh8Hjr6KTZnF1M7KJCv2QYbPudBBfkYqyn+j/uxZA7xbhktAdNOKn4Ywc5V7ipOmsqKpbDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","last_reissued_at":"2026-07-05T05:45:49.916499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:49.916499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.13713","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-07-05T05:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HklAi5+yUJ9gAYtucZS8H0+HSmH/W6EFMyZ3rpSpbo+mzQxbgP/OmRmTdNmWNnM5T7e4lnIaC2f6JNatqhumCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:49:43.432690Z"},"content_sha256":"2d3f47c6c47fc46684539ce1ed5bd036eaef7e6c9f7127f13f91662cb6024ffe","schema_version":"1.0","event_id":"sha256:2d3f47c6c47fc46684539ce1ed5bd036eaef7e6c9f7127f13f91662cb6024ffe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PARO6GKYHGNELEOLBSI3IBNHXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A notion of twins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zach Hunter","submitted_at":"2023-02-27T12:21:19Z","abstract_excerpt":"Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial structures. For example, given a graph $G$, one can ask what is the largest $s$ such that there exist disjoint subsets $I,J\\subset V(G)$ on $s$ vertices, such that the induced subgraphs $G[I],G[J]$ are isomorphic.\n  We are motivated by two different problems of finding twins in two kinds of ordered objects (strings and permutations). We introduce a new variant of `"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13713","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/2302.13713/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"},"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-07-05T05:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Pyqzk6rfRJNM/MeLplYYL+PplmgrKk1hJpjXlIYsMY1vuD8DcoWsD0lwwPRzwLwg6hizwqPbMWOJKcS9/t9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:49:43.433329Z"},"content_sha256":"843ab999cf9a2d3da2b782866f15029b15f8005eba6fc66d16d91cd8ea02de42","schema_version":"1.0","event_id":"sha256:843ab999cf9a2d3da2b782866f15029b15f8005eba6fc66d16d91cd8ea02de42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/bundle.json","state_url":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PARO6GKYHGNELEOLBSI3IBNHXU/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-08-10T11:49:43Z","links":{"resolver":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU","bundle":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/bundle.json","state":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PARO6GKYHGNELEOLBSI3IBNHXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PARO6GKYHGNELEOLBSI3IBNHXU","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":"95c4e46f3ee68311b91724a612279c2d1721aa457560b2daa65e56c1aebcac00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T12:21:19Z","title_canon_sha256":"ad0441d3adfe60c9ba97c9c15fd141dcec4f5b27c39c8e394536d894aedd49d2"},"schema_version":"1.0","source":{"id":"2302.13713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13713","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13713v1","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13713","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"PARO6GKYHGNE","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"pith_short_16","alias_value":"PARO6GKYHGNELEOL","created_at":"2026-07-05T05:45:49Z"},{"alias_kind":"pith_short_8","alias_value":"PARO6GKY","created_at":"2026-07-05T05:45:49Z"}],"graph_snapshots":[{"event_id":"sha256:843ab999cf9a2d3da2b782866f15029b15f8005eba6fc66d16d91cd8ea02de42","target":"graph","created_at":"2026-07-05T05:45:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.13713/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial structures. For example, given a graph $G$, one can ask what is the largest $s$ such that there exist disjoint subsets $I,J\\subset V(G)$ on $s$ vertices, such that the induced subgraphs $G[I],G[J]$ are isomorphic.\n  We are motivated by two different problems of finding twins in two kinds of ordered objects (strings and permutations). We introduce a new variant of `","authors_text":"Zach Hunter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T12:21:19Z","title":"A notion of twins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13713","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:2d3f47c6c47fc46684539ce1ed5bd036eaef7e6c9f7127f13f91662cb6024ffe","target":"record","created_at":"2026-07-05T05:45:49Z","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":"95c4e46f3ee68311b91724a612279c2d1721aa457560b2daa65e56c1aebcac00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T12:21:19Z","title_canon_sha256":"ad0441d3adfe60c9ba97c9c15fd141dcec4f5b27c39c8e394536d894aedd49d2"},"schema_version":"1.0","source":{"id":"2302.13713","kind":"arxiv","version":1}},"canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","first_computed_at":"2026-07-05T05:45:49.916499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:49.916499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QIxBaKRnftjlVQJh8Hjr6KTZnF1M7KJCv2QYbPudBBfkYqyn+j/uxZA7xbhktAdNOKn4Ywc5V7ipOmsqKpbDBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:49.916954Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.13713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d3f47c6c47fc46684539ce1ed5bd036eaef7e6c9f7127f13f91662cb6024ffe","sha256:843ab999cf9a2d3da2b782866f15029b15f8005eba6fc66d16d91cd8ea02de42"],"state_sha256":"f97031f1f6180624d0c6058c54b33c9781ca711275067e2aa92c58276ccc2d63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RT1MfmfW3RqouOM3Gq80KVce7qV/01+Uwid1lEu3SPjTEp6MnMjMp2pUi6n4Jeuf19oPUD5Ji5qutGwBk5MEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T11:49:43.440313Z","bundle_sha256":"bfe702d1b89a844089023d4ae01edc73202b9d5bfa7c7dd99232ad6f4a30be97"}}