{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D2TIULOXGHGLUJ6FMVALI6FCTV","short_pith_number":"pith:D2TIULOX","schema_version":"1.0","canonical_sha256":"1ea68a2dd731ccba27c56540b478a29d47e00b7519926359587076b6cd522b9e","source":{"kind":"arxiv","id":"2507.06873","version":1},"attestation_state":"computed","paper":{"title":"On divisibility relation graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'an Min\\'a\\v{c}, Jonathan L. Merzel, Nguyen Duy T\\^an, Tung T. Nguyen","submitted_at":"2025-07-09T14:12:39Z","abstract_excerpt":"For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of graphs associated with a partial order, which have been widely studied in the literature. In this work, we determine various graph-theoretic invariants of divisibility relation graphs, such as their clique and independence numbers, and their planarity. We also discuss various spectral properties that are discovered by our numerical experiments."},"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":"2507.06873","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-09T14:12:39Z","cross_cats_sorted":[],"title_canon_sha256":"d3efba53d4061b0cbe9160f5a4b0e114b35a402c3af2b2724e64b327d0083228","abstract_canon_sha256":"19f0541963a19665d1ef23a8797e94e2c7bc08738690547f501279892cb16113"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:24.351773Z","signature_b64":"4lgH0O+bhvvPShvdA4EmtZZST8/sljTs/+W3RHE250E9SGZPeG2dXTBmvkbUSdzYH4Hk+M/G/XuKtqtPebY1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea68a2dd731ccba27c56540b478a29d47e00b7519926359587076b6cd522b9e","last_reissued_at":"2026-07-05T11:34:24.351196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:24.351196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On divisibility relation graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'an Min\\'a\\v{c}, Jonathan L. Merzel, Nguyen Duy T\\^an, Tung T. Nguyen","submitted_at":"2025-07-09T14:12:39Z","abstract_excerpt":"For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of graphs associated with a partial order, which have been widely studied in the literature. In this work, we determine various graph-theoretic invariants of divisibility relation graphs, such as their clique and independence numbers, and their planarity. We also discuss various spectral properties that are discovered by our numerical experiments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06873","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/2507.06873/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":"2507.06873","created_at":"2026-07-05T11:34:24.351279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06873v1","created_at":"2026-07-05T11:34:24.351279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06873","created_at":"2026-07-05T11:34:24.351279+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2TIULOXGHGL","created_at":"2026-07-05T11:34:24.351279+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2TIULOXGHGLUJ6F","created_at":"2026-07-05T11:34:24.351279+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2TIULOX","created_at":"2026-07-05T11:34:24.351279+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/D2TIULOXGHGLUJ6FMVALI6FCTV","json":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV.json","graph_json":"https://pith.science/api/pith-number/D2TIULOXGHGLUJ6FMVALI6FCTV/graph.json","events_json":"https://pith.science/api/pith-number/D2TIULOXGHGLUJ6FMVALI6FCTV/events.json","paper":"https://pith.science/paper/D2TIULOX"},"agent_actions":{"view_html":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV","download_json":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV.json","view_paper":"https://pith.science/paper/D2TIULOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06873&json=true","fetch_graph":"https://pith.science/api/pith-number/D2TIULOXGHGLUJ6FMVALI6FCTV/graph.json","fetch_events":"https://pith.science/api/pith-number/D2TIULOXGHGLUJ6FMVALI6FCTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV/action/storage_attestation","attest_author":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV/action/author_attestation","sign_citation":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV/action/citation_signature","submit_replication":"https://pith.science/pith/D2TIULOXGHGLUJ6FMVALI6FCTV/action/replication_record"}},"created_at":"2026-07-05T11:34:24.351279+00:00","updated_at":"2026-07-05T11:34:24.351279+00:00"}