{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z25VIU3MF2TSHXHEUEGRLO4DRW","short_pith_number":"pith:Z25VIU3M","schema_version":"1.0","canonical_sha256":"cebb54536c2ea723dce4a10d15bb838d83261f3e0515e475a33c0f279defe231","source":{"kind":"arxiv","id":"1811.00807","version":2},"attestation_state":"computed","paper":{"title":"Infinitely-many Primes in $\\mathbb{N}$: A Graph Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xandru Mifsud","submitted_at":"2018-11-02T10:22:43Z","abstract_excerpt":"A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of an adjacency operator $\\hat{\\mathbf{A}}(G)$. Lastly, these results are used to give an alternate proof to the known result that there are infinitely many primes in the natural numbers $\\mathbb{N}$."},"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":"1811.00807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-02T10:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"c023bc04520596d2a7be8729299cbc8f1ce84e932e7e4fffe2bc9c6eaedb94a9","abstract_canon_sha256":"af491e0aa36470b61efe65e6875f5d3da55a84da2eb7325d5639a8d6de3721a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:29.465824Z","signature_b64":"en7VwbRB3HpggKhwBlexh3A2tAznX0NafyKz+/4BuNJxrxYxmU1lmCIJE05dhKrxRnvZzIGKwh8kCYLdV7WyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebb54536c2ea723dce4a10d15bb838d83261f3e0515e475a33c0f279defe231","last_reissued_at":"2026-05-18T00:00:29.465209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:29.465209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinitely-many Primes in $\\mathbb{N}$: A Graph Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xandru Mifsud","submitted_at":"2018-11-02T10:22:43Z","abstract_excerpt":"A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of an adjacency operator $\\hat{\\mathbf{A}}(G)$. Lastly, these results are used to give an alternate proof to the known result that there are infinitely many primes in the natural numbers $\\mathbb{N}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00807","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":"1811.00807","created_at":"2026-05-18T00:00:29.465293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00807v2","created_at":"2026-05-18T00:00:29.465293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00807","created_at":"2026-05-18T00:00:29.465293+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z25VIU3MF2TS","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z25VIU3MF2TSHXHE","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z25VIU3M","created_at":"2026-05-18T12:33:04.347982+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/Z25VIU3MF2TSHXHEUEGRLO4DRW","json":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW.json","graph_json":"https://pith.science/api/pith-number/Z25VIU3MF2TSHXHEUEGRLO4DRW/graph.json","events_json":"https://pith.science/api/pith-number/Z25VIU3MF2TSHXHEUEGRLO4DRW/events.json","paper":"https://pith.science/paper/Z25VIU3M"},"agent_actions":{"view_html":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW","download_json":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW.json","view_paper":"https://pith.science/paper/Z25VIU3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00807&json=true","fetch_graph":"https://pith.science/api/pith-number/Z25VIU3MF2TSHXHEUEGRLO4DRW/graph.json","fetch_events":"https://pith.science/api/pith-number/Z25VIU3MF2TSHXHEUEGRLO4DRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW/action/storage_attestation","attest_author":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW/action/author_attestation","sign_citation":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW/action/citation_signature","submit_replication":"https://pith.science/pith/Z25VIU3MF2TSHXHEUEGRLO4DRW/action/replication_record"}},"created_at":"2026-05-18T00:00:29.465293+00:00","updated_at":"2026-05-18T00:00:29.465293+00:00"}