{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M3ODVXCKC63Z2F6CYRADFXHULS","short_pith_number":"pith:M3ODVXCK","schema_version":"1.0","canonical_sha256":"66dc3adc4a17b79d17c2c44032dcf45cb305cc3cf18d35e839fa332cb8d71dc8","source":{"kind":"arxiv","id":"1411.3351","version":1},"attestation_state":"computed","paper":{"title":"Non-recursive freeness and non-rigidity of plane arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Hiraku Kawanoue, Michael Cuntz, Takeshi Nozawa, Takuro Abe","submitted_at":"2014-10-13T14:06:06Z","abstract_excerpt":"In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, Terao's open problem asking whether freeness depends only on combinatorics is true. A long standing problem whether all free arrangements are recursively free or not was settled by the second author and Hoge very recently, by giving a free but non-recursively free plane arrangement consisting of 27 planes. In this paper, we construct free but non-recursively free plane arrangements consisting of 13 and 15 planes, and show that the example with 13 planes is the smalle"},"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":"1411.3351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T14:06:06Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"673cd6b7906bd64a96217ba15dfaaa6dceab992a5faba79be0cde4f81fa050d2","abstract_canon_sha256":"c0b8de046ad2b5eadb99fd64bc4368565caf217b28408dcdedfa8a3f887e86d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.019227Z","signature_b64":"A8Z7dxjH2j1Qku0vkqOl3e6iogmNY9ULCaFRq6tsKnqaTYhvVHakOhvpBGIlv5j9X2PyALTB1FFqBvuynnnLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66dc3adc4a17b79d17c2c44032dcf45cb305cc3cf18d35e839fa332cb8d71dc8","last_reissued_at":"2026-05-18T02:37:44.018700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.018700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-recursive freeness and non-rigidity of plane arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Hiraku Kawanoue, Michael Cuntz, Takeshi Nozawa, Takuro Abe","submitted_at":"2014-10-13T14:06:06Z","abstract_excerpt":"In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, Terao's open problem asking whether freeness depends only on combinatorics is true. A long standing problem whether all free arrangements are recursively free or not was settled by the second author and Hoge very recently, by giving a free but non-recursively free plane arrangement consisting of 27 planes. In this paper, we construct free but non-recursively free plane arrangements consisting of 13 and 15 planes, and show that the example with 13 planes is the smalle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3351","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":"1411.3351","created_at":"2026-05-18T02:37:44.018781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3351v1","created_at":"2026-05-18T02:37:44.018781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3351","created_at":"2026-05-18T02:37:44.018781+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3ODVXCKC63Z","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3ODVXCKC63Z2F6C","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3ODVXCK","created_at":"2026-05-18T12:28:38.356838+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/M3ODVXCKC63Z2F6CYRADFXHULS","json":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS.json","graph_json":"https://pith.science/api/pith-number/M3ODVXCKC63Z2F6CYRADFXHULS/graph.json","events_json":"https://pith.science/api/pith-number/M3ODVXCKC63Z2F6CYRADFXHULS/events.json","paper":"https://pith.science/paper/M3ODVXCK"},"agent_actions":{"view_html":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS","download_json":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS.json","view_paper":"https://pith.science/paper/M3ODVXCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3351&json=true","fetch_graph":"https://pith.science/api/pith-number/M3ODVXCKC63Z2F6CYRADFXHULS/graph.json","fetch_events":"https://pith.science/api/pith-number/M3ODVXCKC63Z2F6CYRADFXHULS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS/action/storage_attestation","attest_author":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS/action/author_attestation","sign_citation":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS/action/citation_signature","submit_replication":"https://pith.science/pith/M3ODVXCKC63Z2F6CYRADFXHULS/action/replication_record"}},"created_at":"2026-05-18T02:37:44.018781+00:00","updated_at":"2026-05-18T02:37:44.018781+00:00"}