{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2APLFXNWBSIGZKOWY4CIOY4IC2","short_pith_number":"pith:2APLFXNW","schema_version":"1.0","canonical_sha256":"d01eb2ddb60c906ca9d6c704876388169b7d7b93817c7afc12845225f70eb012","source":{"kind":"arxiv","id":"1609.08106","version":2},"attestation_state":"computed","paper":{"title":"Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla D. Savage, Megan A. Martinez","submitted_at":"2016-09-26T18:19:28Z","abstract_excerpt":"Inversion sequences of length $n$, $\\mathbf{I}_n$, are integer sequences $(e_1, \\ldots, e_n)$ with $0 \\leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and Corteel-Martinez-Savage-Weselcouch through a systematic study of inversion sequences avoiding words of length 3. We continue this investigation by generalizing the notion of a pattern to a fixed triple of binary relations $(\\rho_1,\\rho_2,\\rho_3)$ and consider the set $\\mathbf{I}_n(\\rho_1,\\rho_2,\\rho_3)$ consisting of those $e \\in \\mathbf{I}_n$ with no $i < j < k$ such that $e"},"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":"1609.08106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-26T18:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"a41549e622a2a5b87329cd39d0c38a28984afa1959ede9082ea9ef17f495f421","abstract_canon_sha256":"e547804ef60824fcb06be9b1915131590924993f8bc27fbafd413d7b95e92d67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:37.612358Z","signature_b64":"trqnCGJQdsJ/XTiLyS36hVoP3Ns0UWdbuS5lvy1WDxWTx85GKH63eKIwv3LGeubCOn3w1nQGphBH5quKAIVWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d01eb2ddb60c906ca9d6c704876388169b7d7b93817c7afc12845225f70eb012","last_reissued_at":"2026-05-18T00:26:37.611670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:37.611670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla D. Savage, Megan A. Martinez","submitted_at":"2016-09-26T18:19:28Z","abstract_excerpt":"Inversion sequences of length $n$, $\\mathbf{I}_n$, are integer sequences $(e_1, \\ldots, e_n)$ with $0 \\leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and Corteel-Martinez-Savage-Weselcouch through a systematic study of inversion sequences avoiding words of length 3. We continue this investigation by generalizing the notion of a pattern to a fixed triple of binary relations $(\\rho_1,\\rho_2,\\rho_3)$ and consider the set $\\mathbf{I}_n(\\rho_1,\\rho_2,\\rho_3)$ consisting of those $e \\in \\mathbf{I}_n$ with no $i < j < k$ such that $e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08106","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":"1609.08106","created_at":"2026-05-18T00:26:37.611750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08106v2","created_at":"2026-05-18T00:26:37.611750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08106","created_at":"2026-05-18T00:26:37.611750+00:00"},{"alias_kind":"pith_short_12","alias_value":"2APLFXNWBSIG","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"2APLFXNWBSIGZKOW","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"2APLFXNW","created_at":"2026-05-18T12:29:52.810259+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/2APLFXNWBSIGZKOWY4CIOY4IC2","json":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2.json","graph_json":"https://pith.science/api/pith-number/2APLFXNWBSIGZKOWY4CIOY4IC2/graph.json","events_json":"https://pith.science/api/pith-number/2APLFXNWBSIGZKOWY4CIOY4IC2/events.json","paper":"https://pith.science/paper/2APLFXNW"},"agent_actions":{"view_html":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2","download_json":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2.json","view_paper":"https://pith.science/paper/2APLFXNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08106&json=true","fetch_graph":"https://pith.science/api/pith-number/2APLFXNWBSIGZKOWY4CIOY4IC2/graph.json","fetch_events":"https://pith.science/api/pith-number/2APLFXNWBSIGZKOWY4CIOY4IC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2/action/storage_attestation","attest_author":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2/action/author_attestation","sign_citation":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2/action/citation_signature","submit_replication":"https://pith.science/pith/2APLFXNWBSIGZKOWY4CIOY4IC2/action/replication_record"}},"created_at":"2026-05-18T00:26:37.611750+00:00","updated_at":"2026-05-18T00:26:37.611750+00:00"}