{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SBKGMDE4HLNNHPBQFL5IWP7GHC","short_pith_number":"pith:SBKGMDE4","schema_version":"1.0","canonical_sha256":"9054660c9c3adad3bc302afa8b3fe638a46e542ba8a50cb578c55c7db3705a12","source":{"kind":"arxiv","id":"1206.0550","version":1},"attestation_state":"computed","paper":{"title":"Enumerations of finite topologies associated with a finite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.CO","authors_text":"Dongseok Kim, Jaeun Lee, Young Soo Kwon","submitted_at":"2012-06-04T08:57:14Z","abstract_excerpt":"The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In this article, we enumerate topologies and non-homeomorphic topologies whose underlying graph is a given finite graph."},"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":"1206.0550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-04T08:57:14Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"d8860836d8b9b6671a9bd5a617cf98bde93d7dd542ddf332bcd912ef0f968af1","abstract_canon_sha256":"7a3fbefbdc58fdada90a3195dc3bf72ff2cf58ba57664b49bef66b916d5b21a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.849598Z","signature_b64":"hz7pXpo1XVk2pKZ41dWQqiSnwuYh1BRMURhenT7czlia6HQZ/YvI7tgtIr4kF5860JA6UWtWAQ0ZJCsHrn2yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9054660c9c3adad3bc302afa8b3fe638a46e542ba8a50cb578c55c7db3705a12","last_reissued_at":"2026-05-18T02:30:32.848982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.848982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerations of finite topologies associated with a finite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.CO","authors_text":"Dongseok Kim, Jaeun Lee, Young Soo Kwon","submitted_at":"2012-06-04T08:57:14Z","abstract_excerpt":"The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In this article, we enumerate topologies and non-homeomorphic topologies whose underlying graph is a given finite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0550","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":"1206.0550","created_at":"2026-05-18T02:30:32.849073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0550v1","created_at":"2026-05-18T02:30:32.849073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0550","created_at":"2026-05-18T02:30:32.849073+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBKGMDE4HLNN","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBKGMDE4HLNNHPBQ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBKGMDE4","created_at":"2026-05-18T12:27:20.899486+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/SBKGMDE4HLNNHPBQFL5IWP7GHC","json":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC.json","graph_json":"https://pith.science/api/pith-number/SBKGMDE4HLNNHPBQFL5IWP7GHC/graph.json","events_json":"https://pith.science/api/pith-number/SBKGMDE4HLNNHPBQFL5IWP7GHC/events.json","paper":"https://pith.science/paper/SBKGMDE4"},"agent_actions":{"view_html":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC","download_json":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC.json","view_paper":"https://pith.science/paper/SBKGMDE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0550&json=true","fetch_graph":"https://pith.science/api/pith-number/SBKGMDE4HLNNHPBQFL5IWP7GHC/graph.json","fetch_events":"https://pith.science/api/pith-number/SBKGMDE4HLNNHPBQFL5IWP7GHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC/action/storage_attestation","attest_author":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC/action/author_attestation","sign_citation":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC/action/citation_signature","submit_replication":"https://pith.science/pith/SBKGMDE4HLNNHPBQFL5IWP7GHC/action/replication_record"}},"created_at":"2026-05-18T02:30:32.849073+00:00","updated_at":"2026-05-18T02:30:32.849073+00:00"}