{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7AUKQOLKEHCQK2OPNSAOANGFDV","short_pith_number":"pith:7AUKQOLK","schema_version":"1.0","canonical_sha256":"f828a8396a21c50569cf6c80e034c51d7430bbfc321a65d002952ba7e3f78966","source":{"kind":"arxiv","id":"2409.04821","version":1},"attestation_state":"computed","paper":{"title":"Adjacency Labeling Schemes for Small Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"\\'Edouard Bonnet, John Sylvester, Julien Duron, Viktor Zamaraev","submitted_at":"2024-09-07T13:26:48Z","abstract_excerpt":"A graph class admits an implicit representation if, for every positive integer $n$, its $n$-vertex graphs have a $O(\\log n)$-bit (adjacency) labeling scheme, i.e., their vertices can be labeled by binary strings of length $O(\\log n)$ such that the presence of an edge between any pair of vertices can be deduced solely from their labels. The famous Implicit Graph Conjecture posited that every hereditary (i.e., closed under taking induced subgraphs) factorial (i.e., containing $2^{O(n \\log n)}$ $n$-vertex graphs) class admits an implicit representation. The conjecture was recently refuted [Hatami"},"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":"2409.04821","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-07T13:26:48Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"35e2b57768d81a64f265c2acc6fc0e2c5e252568a896f068ee1fa87a610e73aa","abstract_canon_sha256":"526dfc995c4f11e6f5267dedf2811e8813093227046bce540b526078e336fd35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:18.474244Z","signature_b64":"ec12OtAYK0qp1KkmQKUakxmbPs7E1IcymwfPXkclhEW3CVFtnQ91s2zUqL7gaK30F0iK8M90W0UnuNw/78mGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f828a8396a21c50569cf6c80e034c51d7430bbfc321a65d002952ba7e3f78966","last_reissued_at":"2026-07-05T09:04:18.473897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:18.473897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adjacency Labeling Schemes for Small Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"\\'Edouard Bonnet, John Sylvester, Julien Duron, Viktor Zamaraev","submitted_at":"2024-09-07T13:26:48Z","abstract_excerpt":"A graph class admits an implicit representation if, for every positive integer $n$, its $n$-vertex graphs have a $O(\\log n)$-bit (adjacency) labeling scheme, i.e., their vertices can be labeled by binary strings of length $O(\\log n)$ such that the presence of an edge between any pair of vertices can be deduced solely from their labels. The famous Implicit Graph Conjecture posited that every hereditary (i.e., closed under taking induced subgraphs) factorial (i.e., containing $2^{O(n \\log n)}$ $n$-vertex graphs) class admits an implicit representation. The conjecture was recently refuted [Hatami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04821","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/2409.04821/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.04821","created_at":"2026-07-05T09:04:18.473953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04821v1","created_at":"2026-07-05T09:04:18.473953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04821","created_at":"2026-07-05T09:04:18.473953+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AUKQOLKEHCQ","created_at":"2026-07-05T09:04:18.473953+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AUKQOLKEHCQK2OP","created_at":"2026-07-05T09:04:18.473953+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AUKQOLK","created_at":"2026-07-05T09:04:18.473953+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19551","citing_title":"Boolean combinations of graphs","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV","json":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV.json","graph_json":"https://pith.science/api/pith-number/7AUKQOLKEHCQK2OPNSAOANGFDV/graph.json","events_json":"https://pith.science/api/pith-number/7AUKQOLKEHCQK2OPNSAOANGFDV/events.json","paper":"https://pith.science/paper/7AUKQOLK"},"agent_actions":{"view_html":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV","download_json":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV.json","view_paper":"https://pith.science/paper/7AUKQOLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04821&json=true","fetch_graph":"https://pith.science/api/pith-number/7AUKQOLKEHCQK2OPNSAOANGFDV/graph.json","fetch_events":"https://pith.science/api/pith-number/7AUKQOLKEHCQK2OPNSAOANGFDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV/action/storage_attestation","attest_author":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV/action/author_attestation","sign_citation":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV/action/citation_signature","submit_replication":"https://pith.science/pith/7AUKQOLKEHCQK2OPNSAOANGFDV/action/replication_record"}},"created_at":"2026-07-05T09:04:18.473953+00:00","updated_at":"2026-07-05T09:04:18.473953+00:00"}