{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M4AZB3IKQSYXHTQMEEIDUJH4R2","short_pith_number":"pith:M4AZB3IK","schema_version":"1.0","canonical_sha256":"670190ed0a84b173ce0c21103a24fc8e8b307679111875d1f8f10779cb679926","source":{"kind":"arxiv","id":"1507.06967","version":2},"attestation_state":"computed","paper":{"title":"Visible lattice points and the chromatic zeta function of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Javier Cilleruelo","submitted_at":"2015-07-24T19:19:08Z","abstract_excerpt":"We study the probability that a cycle of length k in the lattice [1, n]^s does not contain more lattice points than the k vertices of the cycle. Then we generalize this problem to other configurations induced by a given graph H, introducting the chromatic zeta fuction of a 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":"1507.06967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-24T19:19:08Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"309bbc2ad8ab8cdb7cef0faca5c721e0a799df3dd5b2d4ac81d0bc3fe5fba83d","abstract_canon_sha256":"d314a65aeca2bea848c144f27ca7dbaa0daec2cac9867453f2b34296c8bd8bcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.538527Z","signature_b64":"T6upjCCDXBgENPzNWFWgyniAHI29n4l0XC3hEj3uN/Us84vIIuYvPsgdHk4kEtFCt61+o8a7TEBeU31JNSjuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670190ed0a84b173ce0c21103a24fc8e8b307679111875d1f8f10779cb679926","last_reissued_at":"2026-05-18T01:25:11.538015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.538015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visible lattice points and the chromatic zeta function of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Javier Cilleruelo","submitted_at":"2015-07-24T19:19:08Z","abstract_excerpt":"We study the probability that a cycle of length k in the lattice [1, n]^s does not contain more lattice points than the k vertices of the cycle. Then we generalize this problem to other configurations induced by a given graph H, introducting the chromatic zeta fuction of a graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06967","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":"1507.06967","created_at":"2026-05-18T01:25:11.538073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06967v2","created_at":"2026-05-18T01:25:11.538073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06967","created_at":"2026-05-18T01:25:11.538073+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4AZB3IKQSYX","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4AZB3IKQSYXHTQM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4AZB3IK","created_at":"2026-05-18T12:29:32.376354+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/M4AZB3IKQSYXHTQMEEIDUJH4R2","json":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2.json","graph_json":"https://pith.science/api/pith-number/M4AZB3IKQSYXHTQMEEIDUJH4R2/graph.json","events_json":"https://pith.science/api/pith-number/M4AZB3IKQSYXHTQMEEIDUJH4R2/events.json","paper":"https://pith.science/paper/M4AZB3IK"},"agent_actions":{"view_html":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2","download_json":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2.json","view_paper":"https://pith.science/paper/M4AZB3IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06967&json=true","fetch_graph":"https://pith.science/api/pith-number/M4AZB3IKQSYXHTQMEEIDUJH4R2/graph.json","fetch_events":"https://pith.science/api/pith-number/M4AZB3IKQSYXHTQMEEIDUJH4R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2/action/storage_attestation","attest_author":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2/action/author_attestation","sign_citation":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2/action/citation_signature","submit_replication":"https://pith.science/pith/M4AZB3IKQSYXHTQMEEIDUJH4R2/action/replication_record"}},"created_at":"2026-05-18T01:25:11.538073+00:00","updated_at":"2026-05-18T01:25:11.538073+00:00"}