{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SEWDE6YHHIDDZUVGZLD7V2MITX","short_pith_number":"pith:SEWDE6YH","schema_version":"1.0","canonical_sha256":"912c327b073a063cd2a6cac7fae9889dc64a282fa55b6627cbace2a73ab5ccaa","source":{"kind":"arxiv","id":"1607.08195","version":1},"attestation_state":"computed","paper":{"title":"Nearly neighbourly families of standard boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej P. Kisielewicz, Jacek Bojarski, Krzysztof Przes{\\l}awski","submitted_at":"2016-07-27T17:44:15Z","abstract_excerpt":"It is demonstrated that each nearly neighbourly family of standard boxes in $\\mathbb{R}^3$ has at most 12 elements. A combinatorial classification of all such families that have exactly 12 elements is given. All families satisfying an extra property called incompressibility are described. Compressible families are discussed briefly."},"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":"1607.08195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T17:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"3286c2e5f7e9fe9cab5f685ff05299d0a1e616c9ede12a909ec0f43152278d0b","abstract_canon_sha256":"bb540d87d5a54851606e2cd1477a5d91694f4090b385cbeca05625556b74f468"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:20.790905Z","signature_b64":"WsuTGuJn6BcYi9Of0qlbwf1A4bzgJhFJy7iuQVMwBHx1CtpI/ATwIfPbOzhJLQkFEEkGp6SzbHOlPnT+8kCkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"912c327b073a063cd2a6cac7fae9889dc64a282fa55b6627cbace2a73ab5ccaa","last_reissued_at":"2026-05-18T01:10:20.790455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:20.790455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly neighbourly families of standard boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej P. Kisielewicz, Jacek Bojarski, Krzysztof Przes{\\l}awski","submitted_at":"2016-07-27T17:44:15Z","abstract_excerpt":"It is demonstrated that each nearly neighbourly family of standard boxes in $\\mathbb{R}^3$ has at most 12 elements. A combinatorial classification of all such families that have exactly 12 elements is given. All families satisfying an extra property called incompressibility are described. Compressible families are discussed briefly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08195","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":"1607.08195","created_at":"2026-05-18T01:10:20.790525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08195v1","created_at":"2026-05-18T01:10:20.790525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08195","created_at":"2026-05-18T01:10:20.790525+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEWDE6YHHIDD","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEWDE6YHHIDDZUVG","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEWDE6YH","created_at":"2026-05-18T12:30:44.179134+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/SEWDE6YHHIDDZUVGZLD7V2MITX","json":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX.json","graph_json":"https://pith.science/api/pith-number/SEWDE6YHHIDDZUVGZLD7V2MITX/graph.json","events_json":"https://pith.science/api/pith-number/SEWDE6YHHIDDZUVGZLD7V2MITX/events.json","paper":"https://pith.science/paper/SEWDE6YH"},"agent_actions":{"view_html":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX","download_json":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX.json","view_paper":"https://pith.science/paper/SEWDE6YH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08195&json=true","fetch_graph":"https://pith.science/api/pith-number/SEWDE6YHHIDDZUVGZLD7V2MITX/graph.json","fetch_events":"https://pith.science/api/pith-number/SEWDE6YHHIDDZUVGZLD7V2MITX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX/action/storage_attestation","attest_author":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX/action/author_attestation","sign_citation":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX/action/citation_signature","submit_replication":"https://pith.science/pith/SEWDE6YHHIDDZUVGZLD7V2MITX/action/replication_record"}},"created_at":"2026-05-18T01:10:20.790525+00:00","updated_at":"2026-05-18T01:10:20.790525+00:00"}