{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WUTFZDL2MD4LSYXSTSNFMP4UAS","short_pith_number":"pith:WUTFZDL2","schema_version":"1.0","canonical_sha256":"b5265c8d7a60f8b962f29c9a563f940482e24d8deb5aa9048f2c52c9fadf53a5","source":{"kind":"arxiv","id":"1810.02040","version":1},"attestation_state":"computed","paper":{"title":"Counting unlabeled interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H\\\"useyin Acan","submitted_at":"2018-10-04T03:32:38Z","abstract_excerpt":"We improve the bounds on the number of interval graphs on $n$ vertices. In particular, denoting by $I_n$ the quantity in question, we show that $\\log I_n \\sim n\\log n$ as $n\\to \\infty$."},"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":"1810.02040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T03:32:38Z","cross_cats_sorted":[],"title_canon_sha256":"5498d167f65044027067ad37c19d7e16edfd4cdc28f7f7a9ee8d7ca9ab28ad37","abstract_canon_sha256":"5cd6d5a8efcac8bb4ab78f52f74d9fcb0801d27464a38269c62fcadddd3fbaee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.505573Z","signature_b64":"cznuWvY7bQ3yQjGDwezGYqEvKu5UeHzCj809yTGHSrN6wVrb4BrY29ozbCxkt4x44g80qj7U5YPMGw14HFdBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5265c8d7a60f8b962f29c9a563f940482e24d8deb5aa9048f2c52c9fadf53a5","last_reissued_at":"2026-05-18T00:04:06.504894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.504894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting unlabeled interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H\\\"useyin Acan","submitted_at":"2018-10-04T03:32:38Z","abstract_excerpt":"We improve the bounds on the number of interval graphs on $n$ vertices. In particular, denoting by $I_n$ the quantity in question, we show that $\\log I_n \\sim n\\log n$ as $n\\to \\infty$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02040","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.02040","created_at":"2026-05-18T00:04:06.504970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02040v1","created_at":"2026-05-18T00:04:06.504970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02040","created_at":"2026-05-18T00:04:06.504970+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUTFZDL2MD4L","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUTFZDL2MD4LSYXS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUTFZDL2","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS","json":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS.json","graph_json":"https://pith.science/api/pith-number/WUTFZDL2MD4LSYXSTSNFMP4UAS/graph.json","events_json":"https://pith.science/api/pith-number/WUTFZDL2MD4LSYXSTSNFMP4UAS/events.json","paper":"https://pith.science/paper/WUTFZDL2"},"agent_actions":{"view_html":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS","download_json":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS.json","view_paper":"https://pith.science/paper/WUTFZDL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02040&json=true","fetch_graph":"https://pith.science/api/pith-number/WUTFZDL2MD4LSYXSTSNFMP4UAS/graph.json","fetch_events":"https://pith.science/api/pith-number/WUTFZDL2MD4LSYXSTSNFMP4UAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS/action/storage_attestation","attest_author":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS/action/author_attestation","sign_citation":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS/action/citation_signature","submit_replication":"https://pith.science/pith/WUTFZDL2MD4LSYXSTSNFMP4UAS/action/replication_record"}},"created_at":"2026-05-18T00:04:06.504970+00:00","updated_at":"2026-05-18T00:04:06.504970+00:00"}