{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TNRDC5ZBPQUCYB4IDSAGALR472","short_pith_number":"pith:TNRDC5ZB","schema_version":"1.0","canonical_sha256":"9b623177217c282c07881c80602e3cfea4185da71e7766ca2a5ebd5f72d94833","source":{"kind":"arxiv","id":"1501.00165","version":2},"attestation_state":"computed","paper":{"title":"On closed graphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Erskine, David A. Cox","submitted_at":"2014-12-31T16:26:39Z","abstract_excerpt":"A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings and clustering coefficients."},"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":"1501.00165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T16:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"3af99bbcd17037e2919b196ad3deb80ad1c1bc8950a3526c707697147577739f","abstract_canon_sha256":"d3b330e20d24c76e0010ff70791eb72c97570d555e078ef5d6911a4575c37650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:30.517012Z","signature_b64":"gYQWLn75fWOq3kIperfwb3ChDHVBfl4f7RVEKiMlrosSW7i2czOOQJxWCY6t56CvFxl8FVBkHMYY0wxRoq2iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b623177217c282c07881c80602e3cfea4185da71e7766ca2a5ebd5f72d94833","last_reissued_at":"2026-05-18T01:19:30.516423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:30.516423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On closed graphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Erskine, David A. Cox","submitted_at":"2014-12-31T16:26:39Z","abstract_excerpt":"A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings and clustering coefficients."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00165","kind":"arxiv","version":2},"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":"1501.00165","created_at":"2026-05-18T01:19:30.516519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00165v2","created_at":"2026-05-18T01:19:30.516519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00165","created_at":"2026-05-18T01:19:30.516519+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNRDC5ZBPQUC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNRDC5ZBPQUCYB4I","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNRDC5ZB","created_at":"2026-05-18T12:28:49.207871+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/TNRDC5ZBPQUCYB4IDSAGALR472","json":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472.json","graph_json":"https://pith.science/api/pith-number/TNRDC5ZBPQUCYB4IDSAGALR472/graph.json","events_json":"https://pith.science/api/pith-number/TNRDC5ZBPQUCYB4IDSAGALR472/events.json","paper":"https://pith.science/paper/TNRDC5ZB"},"agent_actions":{"view_html":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472","download_json":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472.json","view_paper":"https://pith.science/paper/TNRDC5ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00165&json=true","fetch_graph":"https://pith.science/api/pith-number/TNRDC5ZBPQUCYB4IDSAGALR472/graph.json","fetch_events":"https://pith.science/api/pith-number/TNRDC5ZBPQUCYB4IDSAGALR472/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472/action/storage_attestation","attest_author":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472/action/author_attestation","sign_citation":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472/action/citation_signature","submit_replication":"https://pith.science/pith/TNRDC5ZBPQUCYB4IDSAGALR472/action/replication_record"}},"created_at":"2026-05-18T01:19:30.516519+00:00","updated_at":"2026-05-18T01:19:30.516519+00:00"}