{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ICLGJDSSPMGRJT5YTAFVJOX36D","short_pith_number":"pith:ICLGJDSS","canonical_record":{"source":{"id":"1303.5626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T14:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"c9630d2ffd75110efcc2a7ce7f08e643b4f2020f17428542126fd217196beb8e","abstract_canon_sha256":"b1ba9109eab5d250f31869916df9384732b9efe8fcd0efe7258bb7958931da62"},"schema_version":"1.0"},"canonical_sha256":"4096648e527b0d14cfb8980b54bafbf0cb5c7f941707333586b23657a8ed2562","source":{"kind":"arxiv","id":"1303.5626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5626","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5626v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5626","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"ICLGJDSSPMGR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ICLGJDSSPMGRJT5Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ICLGJDSS","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ICLGJDSSPMGRJT5YTAFVJOX36D","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T14:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"c9630d2ffd75110efcc2a7ce7f08e643b4f2020f17428542126fd217196beb8e","abstract_canon_sha256":"b1ba9109eab5d250f31869916df9384732b9efe8fcd0efe7258bb7958931da62"},"schema_version":"1.0"},"canonical_sha256":"4096648e527b0d14cfb8980b54bafbf0cb5c7f941707333586b23657a8ed2562","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.136270Z","signature_b64":"03GTSgz5euXZ+1bVqUsb3HSJIW+dhhfAEgyC8djlY5QuY2B0cHXSxVf3M88Q4gjZuSDW1zF2gyARvAIb5xFyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4096648e527b0d14cfb8980b54bafbf0cb5c7f941707333586b23657a8ed2562","last_reissued_at":"2026-05-18T02:52:42.135832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.135832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5626","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-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4iOVBg9eEWCabnl3kSmQr7ms55s82GF21YfGfq/6JElFFRtt1wJ66yQYZSyYC8GK0rz1hE0m4GoaAxMJZFQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:50:07.787980Z"},"content_sha256":"53d1b20b5dbc45e01e7181ac1c8317d30d1246557735a9f9d39acb006a0ba5a9","schema_version":"1.0","event_id":"sha256:53d1b20b5dbc45e01e7181ac1c8317d30d1246557735a9f9d39acb006a0ba5a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ICLGJDSSPMGRJT5YTAFVJOX36D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twins in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt","submitted_at":"2013-03-22T14:27:27Z","abstract_excerpt":"A basic pigeonhole principle insures an existence of two objects of the same type if the number of objects is larger than the number of types. Can such a principle be extended to a more complex combinatorial structure? Here, we address such a question for graphs. We call two disjoint subsets $A, B$ of vertices \\emph{\\textbf{twins}} if they have the same cardinality and induce subgraphs of the same size.\n  Let $t(G)$ be the largest $k$ such that $G$ has twins on $k$ vertices each. We provide the bounds on $t(G)$ in terms of the number of edges and vertices using discrepancy results for induced "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5626","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-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iv5vGmPPOiGc1KTw/KMUjqdGuNlS6OXvR8RUT1C20bbay8yUuDPRuUkWZecVJc3Y7TWzkD/s5iip/Hiq7cfVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:50:07.788633Z"},"content_sha256":"308c316e5136ae054fa80ff1d4ea65466bacb04b18e623d4674870bb85c7ed67","schema_version":"1.0","event_id":"sha256:308c316e5136ae054fa80ff1d4ea65466bacb04b18e623d4674870bb85c7ed67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICLGJDSSPMGRJT5YTAFVJOX36D/bundle.json","state_url":"https://pith.science/pith/ICLGJDSSPMGRJT5YTAFVJOX36D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICLGJDSSPMGRJT5YTAFVJOX36D/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-05-19T07:50:07Z","links":{"resolver":"https://pith.science/pith/ICLGJDSSPMGRJT5YTAFVJOX36D","bundle":"https://pith.science/pith/ICLGJDSSPMGRJT5YTAFVJOX36D/bundle.json","state":"https://pith.science/pith/ICLGJDSSPMGRJT5YTAFVJOX36D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICLGJDSSPMGRJT5YTAFVJOX36D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ICLGJDSSPMGRJT5YTAFVJOX36D","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":"b1ba9109eab5d250f31869916df9384732b9efe8fcd0efe7258bb7958931da62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T14:27:27Z","title_canon_sha256":"c9630d2ffd75110efcc2a7ce7f08e643b4f2020f17428542126fd217196beb8e"},"schema_version":"1.0","source":{"id":"1303.5626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5626","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5626v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5626","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"ICLGJDSSPMGR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ICLGJDSSPMGRJT5Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ICLGJDSS","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:308c316e5136ae054fa80ff1d4ea65466bacb04b18e623d4674870bb85c7ed67","target":"graph","created_at":"2026-05-18T02:52:42Z","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":"A basic pigeonhole principle insures an existence of two objects of the same type if the number of objects is larger than the number of types. Can such a principle be extended to a more complex combinatorial structure? Here, we address such a question for graphs. We call two disjoint subsets $A, B$ of vertices \\emph{\\textbf{twins}} if they have the same cardinality and induce subgraphs of the same size.\n  Let $t(G)$ be the largest $k$ such that $G$ has twins on $k$ vertices each. We provide the bounds on $t(G)$ in terms of the number of edges and vertices using discrepancy results for induced ","authors_text":"Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T14:27:27Z","title":"Twins in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5626","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:53d1b20b5dbc45e01e7181ac1c8317d30d1246557735a9f9d39acb006a0ba5a9","target":"record","created_at":"2026-05-18T02:52:42Z","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":"b1ba9109eab5d250f31869916df9384732b9efe8fcd0efe7258bb7958931da62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-22T14:27:27Z","title_canon_sha256":"c9630d2ffd75110efcc2a7ce7f08e643b4f2020f17428542126fd217196beb8e"},"schema_version":"1.0","source":{"id":"1303.5626","kind":"arxiv","version":1}},"canonical_sha256":"4096648e527b0d14cfb8980b54bafbf0cb5c7f941707333586b23657a8ed2562","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4096648e527b0d14cfb8980b54bafbf0cb5c7f941707333586b23657a8ed2562","first_computed_at":"2026-05-18T02:52:42.135832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.135832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03GTSgz5euXZ+1bVqUsb3HSJIW+dhhfAEgyC8djlY5QuY2B0cHXSxVf3M88Q4gjZuSDW1zF2gyARvAIb5xFyDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.136270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d1b20b5dbc45e01e7181ac1c8317d30d1246557735a9f9d39acb006a0ba5a9","sha256:308c316e5136ae054fa80ff1d4ea65466bacb04b18e623d4674870bb85c7ed67"],"state_sha256":"40dc8e4103e7eb5d3d4a613c907cd50a40b6a8d7cae34578e99fb716b8f26909"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WlELs4Qi5B91Q87FDrLLyQffEcg7QH5F5gIKEPv5YWMc74LXW1OXgboTD5ICfVcJ2WhR0zLFqwMPM614oQHZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:50:07.791804Z","bundle_sha256":"6aa084a60cf2e95fe3ac7bf3fb0863892a23e4c82d5f9da6b0c85c10e665fc77"}}