{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R4JZ3MJMGQ3VH4U2RMUWUUWDJW","short_pith_number":"pith:R4JZ3MJM","schema_version":"1.0","canonical_sha256":"8f139db12c343753f29a8b296a52c34d8a9a33d70c13e87f5c2948e6e612dcc0","source":{"kind":"arxiv","id":"1601.07723","version":1},"attestation_state":"computed","paper":{"title":"Non-overlapping matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Antonio Bernini, Elena Barcucci, Renzo Pinzani, Stefano Bilotta","submitted_at":"2016-01-28T11:06:27Z","abstract_excerpt":"Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the $k$-generalized Fibonacci numbers. Moreover, the generating function for the enumerating sequence is easily seen to be rational."},"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":"1601.07723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-28T11:06:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"71bc5dffbddf595bceaa7c44e8eaa715ccd520d10918e4f9dc63baca8146160a","abstract_canon_sha256":"dc708da75f74ccdf409e1f3a40bdc5c0a4252352dbb00da4a1c7e0ae64894cf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:42.341951Z","signature_b64":"SVEh0oBcamo3lO6WW/Q3alyl0meKURsp2N3GClineRxikq8X42NubibEh3fdOIg6UqblVjrRlYAd6n6o2AT2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f139db12c343753f29a8b296a52c34d8a9a33d70c13e87f5c2948e6e612dcc0","last_reissued_at":"2026-05-18T01:21:42.341563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:42.341563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-overlapping matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Antonio Bernini, Elena Barcucci, Renzo Pinzani, Stefano Bilotta","submitted_at":"2016-01-28T11:06:27Z","abstract_excerpt":"Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the $k$-generalized Fibonacci numbers. Moreover, the generating function for the enumerating sequence is easily seen to be rational."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07723","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":"1601.07723","created_at":"2026-05-18T01:21:42.341626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07723v1","created_at":"2026-05-18T01:21:42.341626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07723","created_at":"2026-05-18T01:21:42.341626+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4JZ3MJMGQ3V","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4JZ3MJMGQ3VH4U2","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4JZ3MJM","created_at":"2026-05-18T12:30:41.710351+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/R4JZ3MJMGQ3VH4U2RMUWUUWDJW","json":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW.json","graph_json":"https://pith.science/api/pith-number/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/graph.json","events_json":"https://pith.science/api/pith-number/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/events.json","paper":"https://pith.science/paper/R4JZ3MJM"},"agent_actions":{"view_html":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW","download_json":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW.json","view_paper":"https://pith.science/paper/R4JZ3MJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07723&json=true","fetch_graph":"https://pith.science/api/pith-number/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/graph.json","fetch_events":"https://pith.science/api/pith-number/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/action/storage_attestation","attest_author":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/action/author_attestation","sign_citation":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/action/citation_signature","submit_replication":"https://pith.science/pith/R4JZ3MJMGQ3VH4U2RMUWUUWDJW/action/replication_record"}},"created_at":"2026-05-18T01:21:42.341626+00:00","updated_at":"2026-05-18T01:21:42.341626+00:00"}