{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SEKMDSMCXQJJ5U3L6VIQK3FKMK","short_pith_number":"pith:SEKMDSMC","schema_version":"1.0","canonical_sha256":"9114c1c982bc129ed36bf551056caa629d4d76175ddfe6ae62bf9edf3acadab5","source":{"kind":"arxiv","id":"1210.6667","version":1},"attestation_state":"computed","paper":{"title":"The motif problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Moews, E. Rodney Canfield, R. Daniel Mauldin, Ron Fertig","submitted_at":"2012-10-24T20:03:37Z","abstract_excerpt":"Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some, possibly degenerate, parallelepiped whose edges are parallel to the axes. We show that a set of r points can contain at most r^2 motifs. Generalizing the notion of motif to a sequence of L points in R^p, we show that the maximum number of motifs that can occur in a point set of a given size is related to a linear programming problem arising from hypergraph theory, and discuss some related questions."},"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":"1210.6667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-24T20:03:37Z","cross_cats_sorted":[],"title_canon_sha256":"3a7a775b9766814b68e53d24d8e28ac3d8ccd1b3dbb01f66ebdd4de37f3f6fc7","abstract_canon_sha256":"9a8cb955b98397b60427707a8b244f1c802335b32ef2a47fbd7d8272881c74d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.395708Z","signature_b64":"pj14X/tJMYsfARzyMeocP4DVB4T7UWSGxT1jWYfVw/9MZSZVw7mt974I6IkU3Nh2XUBYDSfZNV39hyQkqYvNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9114c1c982bc129ed36bf551056caa629d4d76175ddfe6ae62bf9edf3acadab5","last_reissued_at":"2026-05-18T03:42:23.395143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.395143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The motif problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Moews, E. Rodney Canfield, R. Daniel Mauldin, Ron Fertig","submitted_at":"2012-10-24T20:03:37Z","abstract_excerpt":"Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some, possibly degenerate, parallelepiped whose edges are parallel to the axes. We show that a set of r points can contain at most r^2 motifs. Generalizing the notion of motif to a sequence of L points in R^p, we show that the maximum number of motifs that can occur in a point set of a given size is related to a linear programming problem arising from hypergraph theory, and discuss some related questions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6667","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":"1210.6667","created_at":"2026-05-18T03:42:23.395224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6667v1","created_at":"2026-05-18T03:42:23.395224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6667","created_at":"2026-05-18T03:42:23.395224+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEKMDSMCXQJJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEKMDSMCXQJJ5U3L","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEKMDSMC","created_at":"2026-05-18T12:27:20.899486+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/SEKMDSMCXQJJ5U3L6VIQK3FKMK","json":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK.json","graph_json":"https://pith.science/api/pith-number/SEKMDSMCXQJJ5U3L6VIQK3FKMK/graph.json","events_json":"https://pith.science/api/pith-number/SEKMDSMCXQJJ5U3L6VIQK3FKMK/events.json","paper":"https://pith.science/paper/SEKMDSMC"},"agent_actions":{"view_html":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK","download_json":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK.json","view_paper":"https://pith.science/paper/SEKMDSMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6667&json=true","fetch_graph":"https://pith.science/api/pith-number/SEKMDSMCXQJJ5U3L6VIQK3FKMK/graph.json","fetch_events":"https://pith.science/api/pith-number/SEKMDSMCXQJJ5U3L6VIQK3FKMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK/action/storage_attestation","attest_author":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK/action/author_attestation","sign_citation":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK/action/citation_signature","submit_replication":"https://pith.science/pith/SEKMDSMCXQJJ5U3L6VIQK3FKMK/action/replication_record"}},"created_at":"2026-05-18T03:42:23.395224+00:00","updated_at":"2026-05-18T03:42:23.395224+00:00"}