{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:767CIQCZHRBH7IBVQR4M7GSRUA","short_pith_number":"pith:767CIQCZ","schema_version":"1.0","canonical_sha256":"ffbe2440593c427fa0358478cf9a51a006ba5c40afb5a33dfc84d1f9e2590582","source":{"kind":"arxiv","id":"1302.4055","version":1},"attestation_state":"computed","paper":{"title":"Free but not recursively free arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Michael Cuntz, Torsten Hoge","submitted_at":"2013-02-17T10:54:14Z","abstract_excerpt":"We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement."},"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":"1302.4055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-02-17T10:54:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c5ede534fbcc81d71cad0a9efa97ab7d76c318666e9088c272e5fe928c6528a8","abstract_canon_sha256":"74286cbb8d3c17672de4ff31cb9a29f9488fbd31cbeb43eb5bb88812d25347d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:24.425093Z","signature_b64":"FKzHlCkqEaHQO3gCjAINkulz5vNH4thB64nyipeOHkg7KGfK6n0C57D/SY5pYuswMiAJvTFKXiAidnYOsKg0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffbe2440593c427fa0358478cf9a51a006ba5c40afb5a33dfc84d1f9e2590582","last_reissued_at":"2026-05-18T03:33:24.424516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:24.424516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Free but not recursively free arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Michael Cuntz, Torsten Hoge","submitted_at":"2013-02-17T10:54:14Z","abstract_excerpt":"We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4055","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":"1302.4055","created_at":"2026-05-18T03:33:24.424600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4055v1","created_at":"2026-05-18T03:33:24.424600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4055","created_at":"2026-05-18T03:33:24.424600+00:00"},{"alias_kind":"pith_short_12","alias_value":"767CIQCZHRBH","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"767CIQCZHRBH7IBV","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"767CIQCZ","created_at":"2026-05-18T12:27:36.564083+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/767CIQCZHRBH7IBVQR4M7GSRUA","json":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA.json","graph_json":"https://pith.science/api/pith-number/767CIQCZHRBH7IBVQR4M7GSRUA/graph.json","events_json":"https://pith.science/api/pith-number/767CIQCZHRBH7IBVQR4M7GSRUA/events.json","paper":"https://pith.science/paper/767CIQCZ"},"agent_actions":{"view_html":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA","download_json":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA.json","view_paper":"https://pith.science/paper/767CIQCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4055&json=true","fetch_graph":"https://pith.science/api/pith-number/767CIQCZHRBH7IBVQR4M7GSRUA/graph.json","fetch_events":"https://pith.science/api/pith-number/767CIQCZHRBH7IBVQR4M7GSRUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA/action/storage_attestation","attest_author":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA/action/author_attestation","sign_citation":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA/action/citation_signature","submit_replication":"https://pith.science/pith/767CIQCZHRBH7IBVQR4M7GSRUA/action/replication_record"}},"created_at":"2026-05-18T03:33:24.424600+00:00","updated_at":"2026-05-18T03:33:24.424600+00:00"}