{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GPQFLEHAKJ3VUSVKDV7Y2A5YJT","short_pith_number":"pith:GPQFLEHA","schema_version":"1.0","canonical_sha256":"33e05590e052775a4aaa1d7f8d03b84cc8591f381026cb602d5de3af7fda9b9a","source":{"kind":"arxiv","id":"1803.10073","version":1},"attestation_state":"computed","paper":{"title":"Etude du graphe divisoriel 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Eric Saias, Pierre Mazet","submitted_at":"2018-03-27T13:40:44Z","abstract_excerpt":"We show that there is a permutation $f$ of the positive integers such that for $n \\geq 2,$ l.c.m.$(f(n), f(n+1)) \\leq cn(\\log n)^2,$ where $c$ is a positive constant. It improves previous results of Erd\\\"os, Freud and Hegyvari (1983), and Chen and Ji (2011)."},"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":"1803.10073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-27T13:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"f9dcacab897b231289f03fd818f4d79b9fbbc6be8f0768410dbf24896abb4ed2","abstract_canon_sha256":"d01dd864b350409a14c89237cd4d82e17ac037429cb8d807afeef3dbbc4874fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:00.530308Z","signature_b64":"3ToBQXvguUOTLk1k1Z927ABzD+2O+JfKH41lIxLsz/A4oQ1MkBN+f5Xr6XotpCpL+k8hSyZwKgkcg1Rb9lgLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33e05590e052775a4aaa1d7f8d03b84cc8591f381026cb602d5de3af7fda9b9a","last_reissued_at":"2026-05-18T00:20:00.529691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:00.529691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Etude du graphe divisoriel 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Eric Saias, Pierre Mazet","submitted_at":"2018-03-27T13:40:44Z","abstract_excerpt":"We show that there is a permutation $f$ of the positive integers such that for $n \\geq 2,$ l.c.m.$(f(n), f(n+1)) \\leq cn(\\log n)^2,$ where $c$ is a positive constant. It improves previous results of Erd\\\"os, Freud and Hegyvari (1983), and Chen and Ji (2011)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10073","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":"1803.10073","created_at":"2026-05-18T00:20:00.529790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10073v1","created_at":"2026-05-18T00:20:00.529790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10073","created_at":"2026-05-18T00:20:00.529790+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPQFLEHAKJ3V","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPQFLEHAKJ3VUSVK","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPQFLEHA","created_at":"2026-05-18T12:32:25.280505+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/GPQFLEHAKJ3VUSVKDV7Y2A5YJT","json":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT.json","graph_json":"https://pith.science/api/pith-number/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/graph.json","events_json":"https://pith.science/api/pith-number/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/events.json","paper":"https://pith.science/paper/GPQFLEHA"},"agent_actions":{"view_html":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT","download_json":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT.json","view_paper":"https://pith.science/paper/GPQFLEHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10073&json=true","fetch_graph":"https://pith.science/api/pith-number/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/graph.json","fetch_events":"https://pith.science/api/pith-number/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/action/storage_attestation","attest_author":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/action/author_attestation","sign_citation":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/action/citation_signature","submit_replication":"https://pith.science/pith/GPQFLEHAKJ3VUSVKDV7Y2A5YJT/action/replication_record"}},"created_at":"2026-05-18T00:20:00.529790+00:00","updated_at":"2026-05-18T00:20:00.529790+00:00"}