{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DRIEAHI2Q5HEE2EFB7XSX77HKH","short_pith_number":"pith:DRIEAHI2","schema_version":"1.0","canonical_sha256":"1c50401d1a874e4268850fef2bffe751d125f378ea7f0fde3d2fb8540546b30f","source":{"kind":"arxiv","id":"1409.0656","version":1},"attestation_state":"computed","paper":{"title":"A note on the number of edges of the Jaco Graph, $J_n(1), n \\in \\Bbb N","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Vivian Mukungunugwa","submitted_at":"2014-09-02T10:26:13Z","abstract_excerpt":"Kok et.al. [3] introduced Jaco Graphs \\emph{(order 1)}. It is hoped that as a special case, a closed formula can be found for the number of edges of a finite Jaco Graph $J_n(1)$. However, the algorithms discussed in Ahlbach et.al. [1] suggest this might not be possible. Finding a closed formula for the number of edges of a Jaco Graph $J_n(1), n \\in \\Bbb N$ remains an interesting open problem. In this note we present three alternative, \\emph{formula}."},"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":"1409.0656","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-09-02T10:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"e6489a6e94b972e578ca4cf61602d16f3f8cff716630735a724e6c71c7226c05","abstract_canon_sha256":"f1c6b8a234b6a409d4bcb0e2e936a6efc8eccb4512679461d1f4eed860b37e03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:46.391846Z","signature_b64":"PtFS/LEh7EbDY0oKZD55J4wsZjkEA9e/jepxgCTThz+KG+aaX2w9H1NHeec5pKfbADBbPGLpjaXKb0yJFED4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c50401d1a874e4268850fef2bffe751d125f378ea7f0fde3d2fb8540546b30f","last_reissued_at":"2026-05-18T02:43:46.391483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:46.391483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the number of edges of the Jaco Graph, $J_n(1), n \\in \\Bbb N","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Vivian Mukungunugwa","submitted_at":"2014-09-02T10:26:13Z","abstract_excerpt":"Kok et.al. [3] introduced Jaco Graphs \\emph{(order 1)}. It is hoped that as a special case, a closed formula can be found for the number of edges of a finite Jaco Graph $J_n(1)$. However, the algorithms discussed in Ahlbach et.al. [1] suggest this might not be possible. Finding a closed formula for the number of edges of a Jaco Graph $J_n(1), n \\in \\Bbb N$ remains an interesting open problem. In this note we present three alternative, \\emph{formula}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0656","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":"1409.0656","created_at":"2026-05-18T02:43:46.391538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0656v1","created_at":"2026-05-18T02:43:46.391538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0656","created_at":"2026-05-18T02:43:46.391538+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRIEAHI2Q5HE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRIEAHI2Q5HEE2EF","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRIEAHI2","created_at":"2026-05-18T12:28:25.294606+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/DRIEAHI2Q5HEE2EFB7XSX77HKH","json":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH.json","graph_json":"https://pith.science/api/pith-number/DRIEAHI2Q5HEE2EFB7XSX77HKH/graph.json","events_json":"https://pith.science/api/pith-number/DRIEAHI2Q5HEE2EFB7XSX77HKH/events.json","paper":"https://pith.science/paper/DRIEAHI2"},"agent_actions":{"view_html":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH","download_json":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH.json","view_paper":"https://pith.science/paper/DRIEAHI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0656&json=true","fetch_graph":"https://pith.science/api/pith-number/DRIEAHI2Q5HEE2EFB7XSX77HKH/graph.json","fetch_events":"https://pith.science/api/pith-number/DRIEAHI2Q5HEE2EFB7XSX77HKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH/action/storage_attestation","attest_author":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH/action/author_attestation","sign_citation":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH/action/citation_signature","submit_replication":"https://pith.science/pith/DRIEAHI2Q5HEE2EFB7XSX77HKH/action/replication_record"}},"created_at":"2026-05-18T02:43:46.391538+00:00","updated_at":"2026-05-18T02:43:46.391538+00:00"}