{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XON77GVI3RAORQD2MVW3XLHHH2","short_pith_number":"pith:XON77GVI","schema_version":"1.0","canonical_sha256":"bb9bff9aa8dc40e8c07a656dbbace73ebb0463c29f586ab470e2e823430c9257","source":{"kind":"arxiv","id":"1308.0311","version":2},"attestation_state":"computed","paper":{"title":"On the partition of R^n by hyperplanes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Armen Bagdasaryan","submitted_at":"2013-07-31T17:20:04Z","abstract_excerpt":"The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n by m hyperplanes. We rederive an explicit formula for the number of components into which the space can be partitioned by m hyperplanes."},"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":"1308.0311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-07-31T17:20:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"293e1f2e5edf412e2fdadffe18b5f7f63697abcc7e3e8fbcb2c19f5c1d4d509d","abstract_canon_sha256":"a60eccb9ff1d6f0dfd063b14d0fadb119ece6ffac85f6c0f5d90a680d6cda990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:37.439633Z","signature_b64":"Fo8YqXdrgUl9wh6rUr01t/Fr7U14V3ho+ljp8w4Uw/cOy0mMydAdk4KwZ/SQiyKjMg9lOhUrIaisFdTIwo7WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb9bff9aa8dc40e8c07a656dbbace73ebb0463c29f586ab470e2e823430c9257","last_reissued_at":"2026-05-18T03:04:37.438687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:37.438687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the partition of R^n by hyperplanes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Armen Bagdasaryan","submitted_at":"2013-07-31T17:20:04Z","abstract_excerpt":"The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n by m hyperplanes. We rederive an explicit formula for the number of components into which the space can be partitioned by m hyperplanes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0311","kind":"arxiv","version":2},"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":"1308.0311","created_at":"2026-05-18T03:04:37.438855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0311v2","created_at":"2026-05-18T03:04:37.438855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0311","created_at":"2026-05-18T03:04:37.438855+00:00"},{"alias_kind":"pith_short_12","alias_value":"XON77GVI3RAO","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XON77GVI3RAORQD2","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XON77GVI","created_at":"2026-05-18T12:28:06.772260+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/XON77GVI3RAORQD2MVW3XLHHH2","json":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2.json","graph_json":"https://pith.science/api/pith-number/XON77GVI3RAORQD2MVW3XLHHH2/graph.json","events_json":"https://pith.science/api/pith-number/XON77GVI3RAORQD2MVW3XLHHH2/events.json","paper":"https://pith.science/paper/XON77GVI"},"agent_actions":{"view_html":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2","download_json":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2.json","view_paper":"https://pith.science/paper/XON77GVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0311&json=true","fetch_graph":"https://pith.science/api/pith-number/XON77GVI3RAORQD2MVW3XLHHH2/graph.json","fetch_events":"https://pith.science/api/pith-number/XON77GVI3RAORQD2MVW3XLHHH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2/action/storage_attestation","attest_author":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2/action/author_attestation","sign_citation":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2/action/citation_signature","submit_replication":"https://pith.science/pith/XON77GVI3RAORQD2MVW3XLHHH2/action/replication_record"}},"created_at":"2026-05-18T03:04:37.438855+00:00","updated_at":"2026-05-18T03:04:37.438855+00:00"}