{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KGMX3XILLNNPXA6VVVAL3IBKM5","short_pith_number":"pith:KGMX3XIL","canonical_record":{"source":{"id":"1410.4084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T14:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d6d22fb4da0f6766c5f596d8d69a0593dec3495842ff393fd522178385dfff0e","abstract_canon_sha256":"b852e5f5e6b4000c56cbcf967a0d4935294a507df5ed2f5835146af251eb93d9"},"schema_version":"1.0"},"canonical_sha256":"51997ddd0b5b5afb83d5ad40bda02a6748e98bb35b742f8a2593d135502cb5a6","source":{"kind":"arxiv","id":"1410.4084","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4084","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4084v1","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4084","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"KGMX3XILLNNP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KGMX3XILLNNPXA6V","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KGMX3XIL","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KGMX3XILLNNPXA6VVVAL3IBKM5","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T14:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d6d22fb4da0f6766c5f596d8d69a0593dec3495842ff393fd522178385dfff0e","abstract_canon_sha256":"b852e5f5e6b4000c56cbcf967a0d4935294a507df5ed2f5835146af251eb93d9"},"schema_version":"1.0"},"canonical_sha256":"51997ddd0b5b5afb83d5ad40bda02a6748e98bb35b742f8a2593d135502cb5a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:02.671240Z","signature_b64":"lghdDHclp8j6u2fT2jlBqw65GUadkValucNbuwwN5CgI69kyljhKBuOQUg/joMUJtXzMyRqehgApJL4BUy1HAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51997ddd0b5b5afb83d5ad40bda02a6748e98bb35b742f8a2593d135502cb5a6","last_reissued_at":"2026-05-18T02:40:02.670781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:02.670781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4084","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:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/lm3gY0QYAEsZVEJLHpVaIWdgQOQ04qzUUTKWCK0RlVeWdCn33H2wRN3cXODzB/bNK3vgTl+DjwFAJ7illxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:48:16.465513Z"},"content_sha256":"797ec035a3661fa6da52cea5ff2975cf9ea849c55c9db8c5b4ad6b54ba1f352f","schema_version":"1.0","event_id":"sha256:797ec035a3661fa6da52cea5ff2975cf9ea849c55c9db8c5b4ad6b54ba1f352f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KGMX3XILLNNPXA6VVVAL3IBKM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implicit Representations and Factorial Properties of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas, Andrew Collins, Vadim Lozin, Victor Zamaraev","submitted_at":"2014-10-15T14:55:52Z","abstract_excerpt":"The idea of implicit representation of graphs was introduced in [S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, SIAM J. Discrete Mathematics, 5 (1992) 596--603] and can be defined as follows. A representation of an $n$-vertex graph $G$ is said to be implicit if it assigns to each vertex of $G$ a binary code of length $O(\\log n)$ so that the adjacency of two vertices is a function of their codes. Since an implicit representation of an $n$-vertex graph uses $O(n\\log n)$ bits, any class of graphs admitting such a representation contains $2^{O(n\\log n)}$ labelled graphs with $n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4084","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:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ndtsZJgfcRPm+lWiRsvC4UtnZ/hhS21O/WkybbqlliFyYeXIPGB5ONjWiduGm86j0xGFTZolU3wS8Bp2vVbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:48:16.465866Z"},"content_sha256":"95cc28c40a5e1041e6aeb1cd72b9c85a2ad0a0965386256370f65cf0750098e5","schema_version":"1.0","event_id":"sha256:95cc28c40a5e1041e6aeb1cd72b9c85a2ad0a0965386256370f65cf0750098e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGMX3XILLNNPXA6VVVAL3IBKM5/bundle.json","state_url":"https://pith.science/pith/KGMX3XILLNNPXA6VVVAL3IBKM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGMX3XILLNNPXA6VVVAL3IBKM5/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-01T04:48:16Z","links":{"resolver":"https://pith.science/pith/KGMX3XILLNNPXA6VVVAL3IBKM5","bundle":"https://pith.science/pith/KGMX3XILLNNPXA6VVVAL3IBKM5/bundle.json","state":"https://pith.science/pith/KGMX3XILLNNPXA6VVVAL3IBKM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGMX3XILLNNPXA6VVVAL3IBKM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KGMX3XILLNNPXA6VVVAL3IBKM5","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":"b852e5f5e6b4000c56cbcf967a0d4935294a507df5ed2f5835146af251eb93d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T14:55:52Z","title_canon_sha256":"d6d22fb4da0f6766c5f596d8d69a0593dec3495842ff393fd522178385dfff0e"},"schema_version":"1.0","source":{"id":"1410.4084","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4084","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4084v1","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4084","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"KGMX3XILLNNP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KGMX3XILLNNPXA6V","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KGMX3XIL","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:95cc28c40a5e1041e6aeb1cd72b9c85a2ad0a0965386256370f65cf0750098e5","target":"graph","created_at":"2026-05-18T02:40:02Z","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 idea of implicit representation of graphs was introduced in [S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, SIAM J. Discrete Mathematics, 5 (1992) 596--603] and can be defined as follows. A representation of an $n$-vertex graph $G$ is said to be implicit if it assigns to each vertex of $G$ a binary code of length $O(\\log n)$ so that the adjacency of two vertices is a function of their codes. Since an implicit representation of an $n$-vertex graph uses $O(n\\log n)$ bits, any class of graphs admitting such a representation contains $2^{O(n\\log n)}$ labelled graphs with $n$","authors_text":"Aistis Atminas, Andrew Collins, Vadim Lozin, Victor Zamaraev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T14:55:52Z","title":"Implicit Representations and Factorial Properties of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4084","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:797ec035a3661fa6da52cea5ff2975cf9ea849c55c9db8c5b4ad6b54ba1f352f","target":"record","created_at":"2026-05-18T02:40:02Z","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":"b852e5f5e6b4000c56cbcf967a0d4935294a507df5ed2f5835146af251eb93d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T14:55:52Z","title_canon_sha256":"d6d22fb4da0f6766c5f596d8d69a0593dec3495842ff393fd522178385dfff0e"},"schema_version":"1.0","source":{"id":"1410.4084","kind":"arxiv","version":1}},"canonical_sha256":"51997ddd0b5b5afb83d5ad40bda02a6748e98bb35b742f8a2593d135502cb5a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51997ddd0b5b5afb83d5ad40bda02a6748e98bb35b742f8a2593d135502cb5a6","first_computed_at":"2026-05-18T02:40:02.670781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:02.670781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lghdDHclp8j6u2fT2jlBqw65GUadkValucNbuwwN5CgI69kyljhKBuOQUg/joMUJtXzMyRqehgApJL4BUy1HAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:02.671240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4084","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:797ec035a3661fa6da52cea5ff2975cf9ea849c55c9db8c5b4ad6b54ba1f352f","sha256:95cc28c40a5e1041e6aeb1cd72b9c85a2ad0a0965386256370f65cf0750098e5"],"state_sha256":"4c1e54cf89a154b91f7ddef7fbf4c81f3948708ea4fd96b2f95a7b9017bc9c66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8UN2d32rcdK6CaKqOTOSvNSCGHPhilWEwMxET5k8enYPCm9sjlVDp+eDb914MZkGdP2nAQyI7xpmd1VqV74DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:48:16.468177Z","bundle_sha256":"f39ace304a344007cdcdb756d866f2dfc6638e5069e8fe58703d2892fe84c164"}}