{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NTCDXNU4F5CP53JWSHDMNTWVB6","short_pith_number":"pith:NTCDXNU4","schema_version":"1.0","canonical_sha256":"6cc43bb69c2f44feed3691c6c6ced50f8e839756abf07cbd06e03cfa4ef38e26","source":{"kind":"arxiv","id":"1401.4502","version":3},"attestation_state":"computed","paper":{"title":"Infinite graphs that do not contain cycles of length four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Javier Cilleruelo","submitted_at":"2014-01-18T01:03:31Z","abstract_excerpt":"We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs $G_n$ induced by the first $n$ vertices has minimum degree $\\delta(G_n)> n^{\\sqrt{2}-1+o(1)}$."},"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":"1401.4502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-18T01:03:31Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"332852e759716d6fe2178d04d30c5478b888bd2dd56ea0ba8d04f8de4b61e3af","abstract_canon_sha256":"28defb70ef2cf538363fc123a98eb867957e123e03706c4ccaa275dd33138443"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:10.672715Z","signature_b64":"Da+TVHJqJ+q0YxhmtgMDYk1lj0xzZqed4iIpVzI/49eeYJ38MRpDN2gGMCbLeFRrkCHoxAI9wEtEC7AFmTjRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc43bb69c2f44feed3691c6c6ced50f8e839756abf07cbd06e03cfa4ef38e26","last_reissued_at":"2026-05-18T01:22:10.671812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:10.671812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite graphs that do not contain cycles of length four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Javier Cilleruelo","submitted_at":"2014-01-18T01:03:31Z","abstract_excerpt":"We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs $G_n$ induced by the first $n$ vertices has minimum degree $\\delta(G_n)> n^{\\sqrt{2}-1+o(1)}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4502","kind":"arxiv","version":3},"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":"1401.4502","created_at":"2026-05-18T01:22:10.671963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4502v3","created_at":"2026-05-18T01:22:10.671963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4502","created_at":"2026-05-18T01:22:10.671963+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTCDXNU4F5CP","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTCDXNU4F5CP53JW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTCDXNU4","created_at":"2026-05-18T12:28:41.024544+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/NTCDXNU4F5CP53JWSHDMNTWVB6","json":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6.json","graph_json":"https://pith.science/api/pith-number/NTCDXNU4F5CP53JWSHDMNTWVB6/graph.json","events_json":"https://pith.science/api/pith-number/NTCDXNU4F5CP53JWSHDMNTWVB6/events.json","paper":"https://pith.science/paper/NTCDXNU4"},"agent_actions":{"view_html":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6","download_json":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6.json","view_paper":"https://pith.science/paper/NTCDXNU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4502&json=true","fetch_graph":"https://pith.science/api/pith-number/NTCDXNU4F5CP53JWSHDMNTWVB6/graph.json","fetch_events":"https://pith.science/api/pith-number/NTCDXNU4F5CP53JWSHDMNTWVB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6/action/storage_attestation","attest_author":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6/action/author_attestation","sign_citation":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6/action/citation_signature","submit_replication":"https://pith.science/pith/NTCDXNU4F5CP53JWSHDMNTWVB6/action/replication_record"}},"created_at":"2026-05-18T01:22:10.671963+00:00","updated_at":"2026-05-18T01:22:10.671963+00:00"}